559. Maximum Depth of N-ary Tree https://leetcode.com/problems/maximum-depth-of-n-ary-tree
112. Path Sum https://leetcode.com/problems/path-sum
113. Path Sum II https://leetcode.com/problems/path-sum-ii
617. Merge Two Binary Trees https://leetcode.com/problems/merge-two-binary-trees
897. Increasing Order Search Tree https://leetcode.com/problems/increasing-order-search-tree
938. Range Sum of BST https://leetcode.com/problems/range-sum-of-bst
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
Prerequisites
Before reading this article, you should first learn:
Some problems can be solved using both "traversal" and "problem decomposition" approaches. You can use these problems to train your thinking.
