树
matt__
这个作者很懒,什么都没留下…
展开
-
leetcode 94. 二叉树的中序遍历(栈实现)
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cl...翻译 2019-08-02 10:46:40 · 153 阅读 · 0 评论 -
leetcode 98. 验证二叉搜索树(边界细节处理防止溢出)
class Solution {public: bool isValidBST(TreeNode* root) { return dfs(root, LONG_MIN, LONG_MAX); /*if (root == NULL)return true; if (root->left->val >= root->val||root->...翻译 2019-08-02 10:42:26 · 189 阅读 · 0 评论 -
leetcode 101. 对称二叉树(递归与非递归)
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; *//*...翻译 2019-08-02 10:58:39 · 205 阅读 · 0 评论 -
leetcode 105. 从前序与中序遍历序列构造二叉树(哈希)
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */c...翻译 2019-08-02 11:15:28 · 128 阅读 · 0 评论 -
leetcode 236. 二叉树的最近公共祖先
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cl...翻译 2019-08-02 11:19:46 · 113 阅读 · 0 评论 -
leetcode 543. 二叉树的直径
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cl...翻译 2019-08-02 11:32:10 · 191 阅读 · 0 评论 -
leetcode 124. 二叉树中的最大路径和
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */cl...翻译 2019-08-02 11:34:55 · 104 阅读 · 0 评论 -
leetcode 297. 二叉树的序列化与反序列化
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */c...翻译 2019-08-02 11:42:04 · 183 阅读 · 0 评论