摘要：
```
class Solution {
public: TreeNode *sortedListToBST(ListNode* head) { if (!head) return NULL; if (!head->next) return new TreeNode(head->val); ListNode *slow = head, *fa... 阅读全文
posted @ 2019-04-09 14:57
JohnRed
阅读(67)
评论(0)
推荐(0)
摘要：
``` class Solution { public: TreeNode* sortedArrayToBST(vector& nums) { return helper(nums, 0 , (int)nums.size() - 1); } TreeNode* helper(vector& nums, int left, int right) { ... 阅读全文
posted @ 2019-04-09 14:55
JohnRed
阅读(64)
评论(0)
推荐(0)
摘要：
``` /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class So... 阅读全文
posted @ 2019-04-09 14:46
JohnRed
阅读(69)
评论(0)
推荐(0)
摘要：
``` /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class So... 阅读全文
posted @ 2019-04-09 14:44
JohnRed
阅读(87)
评论(0)
推荐(0)
摘要：
``` /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class So... 阅读全文
posted @ 2019-04-09 14:43
JohnRed
阅读(79)
评论(0)
推荐(0)
摘要：
``` class Solution { public: int maxDepth(TreeNode* root) { if (!root) return 0; return 1 + max(maxDepth(root->left), maxDepth(root->right)); } }; ``` ``` class Solution { pub... 阅读全文
posted @ 2019-04-09 14:40
JohnRed
阅读(82)
评论(0)
推荐(0)
摘要：
``` /** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class So... 阅读全文
posted @ 2019-04-09 14:39
JohnRed
阅读(67)
评论(0)
推荐(0)
摘要：
``` class Solution { public: vector> levelOrder(TreeNode* root) { if (!root) return {}; vector> res; queue q{{root}}; while (!q.empty()) { vector oneLev... 阅读全文
posted @ 2019-04-09 14:37
JohnRed
阅读(64)
评论(0)
推荐(0)
摘要：
``` class Solution { public: bool isSymmetric(TreeNode *root) { if (!root) return true; return isSymmetric(root->left, root->right); } bool isSymmetric(TreeNode *left, Tree... 阅读全文
posted @ 2019-04-09 14:36
JohnRed
阅读(71)
评论(0)
推荐(0)
摘要：
``` class Solution { public: bool isSameTree(TreeNode *p, TreeNode *q) { if (!p && !q) return true; if ((p && !q) || (!p && q) || (p->val != q->val)) return false; return i... 阅读全文
posted @ 2019-04-09 14:32
JohnRed
阅读(76)
评论(0)
推荐(0)
浙公网安备 33010602011771号