음하하하

[Palindrome Partitioning]

https://leetcode.com/problems/palindrome-partitioning/

def dfs(sublist, str)

if not str

ret += sublist

else

for str의 0번 인덱스 시작 길이가 1부터 len(str)까지의 모든 substring

if substring is palindrome

dfs(sublist += substring, str에서 substring을 제외한 나머지)

[Binary Tree Preorder, Inorder, Postorder]

https://leetcode.com/problems/binary-tree-preorder-traversal/

https://leetcode.com/problems/binary-tree-inorder-traversal/

https://leetcode.com/problems/binary-tree-postorder-traversal/

stack, hash

reverse(preorder) = postorder