Truring的博客

题目链接https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/解题代码/*// Definition for a Node.class Node {public: int val; vector<Node*> children; Node() {} Node(int _val) { val = _val; } Node(int _val,

题目链接https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/解题代码/*// Definition for a Node.class Node {public: int val; vector<Node*> children; Node() {} Node(int _val) { val = _val; } Node(int _val, v

题目链接https://leetcode-cn.com/problems/range-sum-of-bst/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * T

题目链接https://leetcode-cn.com/problems/increasing-order-search-tree/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr)

题目链接https://leetcode-cn.com/problems/leaf-similar-trees/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} *

题目链接https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right

题目链接https://leetcode-cn.com/problems/subtree-of-another-tree/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {}

题目链接https://leetcode-cn.com/problems/er-cha-shu-de-shen-du-lcof/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {}

题目链接https://leetcode-cn.com/problems/search-in-a-binary-search-tree/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullpt

题目链接https://leetcode-cn.com/problems/univalued-binary-tree/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }

链接https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree/解题代码/*// Definition for a Node.class Node {public: int val; vector<Node*> children; Node() {} Node(int _val) { val = _val; } Node(int _val, vector

链接https://leetcode-cn.com/problems/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) {} *

题目描述，链接https://leetcode-cn.com/problems/find-mode-in-binary-search-tree/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nu

题目描述，链接https://leetcode-cn.com/problems/sum-of-left-leaves/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }

题目描述，链接https://leetcode-cn.com/problems/binary-tree-paths/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} *

题目详情，链接https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/解题代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), lef

226. 翻转二叉树以下是实现代码，运用了递归函数，将问题拆分成一个个可以解决的小问题。/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x)