【强化练习】同时运用两种思维解题

559. N 叉树的最大深度 https://leetcode.cn/problems/maximum-depth-of-n-ary-tree

559. Maximum Depth of N-ary Tree https://leetcode.com/problems/maximum-depth-of-n-ary-tree

339. 嵌套列表权重和 https://leetcode.cn/problems/nested-list-weight-sum

339. Nested List Weight Sum https://leetcode.com/problems/nested-list-weight-sum

364. 加权嵌套序列和 II https://leetcode.cn/problems/nested-list-weight-sum-ii

364. Nested List Weight Sum II https://leetcode.com/problems/nested-list-weight-sum-ii

112. 路径总和 https://leetcode.cn/problems/path-sum

112. Path Sum https://leetcode.com/problems/path-sum

113. 路径总和 II https://leetcode.cn/problems/path-sum-ii

113. Path Sum II https://leetcode.com/problems/path-sum-ii

617. 合并二叉树 https://leetcode.cn/problems/merge-two-binary-trees

617. Merge Two Binary Trees https://leetcode.com/problems/merge-two-binary-trees

897. 递增顺序搜索树 https://leetcode.cn/problems/increasing-order-search-tree

897. Increasing Order Search Tree https://leetcode.com/problems/increasing-order-search-tree

938. 二叉搜索树的范围和 https://leetcode.cn/problems/range-sum-of-bst

938. Range Sum of BST https://leetcode.com/problems/range-sum-of-bst

1379. 找出克隆二叉树中的相同节点 https://leetcode.cn/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree

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

1430. 判断给定的序列是否是二叉树从根到叶的路径 https://leetcode.cn/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree

1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree https://leetcode.com/problems/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree

1490. 克隆 N 叉树 https://leetcode.cn/problems/clone-n-ary-tree

1490. Clone N-ary Tree https://leetcode.com/problems/clone-n-ary-tree

剑指 Offer 26. 树的子结构 https://leetcode.cn/problems/shu-de-zi-jie-gou-lcof

剑指 Offer 26. 树的子结构 LCOF https://leetcode.com/problems/shu-de-zi-jie-gou-lcof