今日计划 | DFS Tree

总结,熟练两种解决方法。

Leetcode

• 144. Binary Tree Preorder Traversal
• 94. Binary Tree Inorder Traversal
• 145. Binary Tree Postorder Traversal
• 110. Balanced Binary Tree
• 111. Minimum Depth of Binary Tree
• 104. Maximum Depth of Binary Tree
• 285. Inorder Successor in BST
• 112. Path Sum
• 113. Path Sum II
• 437. Path Sum III
• 173. Binary Search Tree Iterator