无远弗届

Leetcode606. Construct String from Binary Tree Leetcode606. Construct String from Binary Tree 递归方法可以一行完成，迭代方法比较麻烦。复杂度不佳，尚待提高。 代码如下： /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right

Leetcode590. N-ary Tree Postorder Traversal Leetcode590. N-ary Tree Postorder Traversal 和589类似，注意孩子节点的入栈顺序即可 代码如下： /* // Definition for a Node. class Node { public: int val; vector<Node*> children; Node() {} Node(int _val) {

Leetcode589. N-ary Tree Preorder Traversal Leetcode589. N-ary Tree Preorder Traversal 递归与非递归（DFS）： /* // Definition for a Node. class Node { public: int val; vector<Node*> children; Node() {} Node(int _val) { val = _val;

Leetcode617. Merge Two Binary Trees 简单题，迭代比递归复杂一点点 代码如下： /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeN

Leetcode面试题 04.02. 最小高度树 面试题 04.02. 最小高度树 简单递归构造树，解答如下： /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ clas