![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Tree-BST
Jinning Yang
这个作者很懒,什么都没留下…
展开
-
110. Balanced Binary Tree
110. Balanced Binary Tree/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode原创 2020-08-07 06:27:07 · 83 阅读 · 0 评论 -
101. Symmetric Tree
101. Symmetric Tree/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left,原创 2020-08-06 09:29:34 · 88 阅读 · 0 评论 -
543. Diameter of Binary Tree
543.Diameter of Binary Treeclass Solution { private int diameter = 0; //O(n) time, O(n) space taken by recursive call stack in skewed binary tree private int computeDiameter(TreeNode node){ if(node==null) return 0;.原创 2020-08-06 07:59:28 · 99 阅读 · 0 评论 -
563. Binary Tree Tilt
563. Binary Tree Tiltclass Solution { int res; public int findTilt(TreeNode root) { res=0; dfs(root); return res; } public int dfs(TreeNode root){ if(root==null){ return 0; }原创 2020-08-06 07:58:18 · 64 阅读 · 0 评论 -
235. Lowest Common Ancestor of a Binary Search Tree
235. Lowest Common Ancestor of a Binary Search Tree/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */class Solution { public原创 2020-08-02 04:31:43 · 63 阅读 · 0 评论 -
993. Cousins in Binary Tree
993. Cousins in Binary Treeclass Solution { public boolean isCousins(TreeNode root, int x, int y) { return dfs(root,x,y); } public boolean dfs(TreeNode root,int x,int y){ if(root==null){ return false; }原创 2020-08-02 03:19:41 · 94 阅读 · 0 评论 -
107. Binary Tree Level Order Traversal II
107. Binary Tree Level Order Traversal II/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(in原创 2020-07-31 00:21:00 · 49 阅读 · 0 评论 -
108. Convert Sorted Array to Binary Search Tree
108. Convert Sorted Array to Binary Search Tree/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeN原创 2020-07-29 22:48:10 · 78 阅读 · 0 评论 -
669. Trim a Binary Search Tree
669. Trim a Binary Search Tree/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, Tree原创 2020-07-25 05:01:20 · 50 阅读 · 0 评论 -
226. Invert Binary Tree
226. Invert Binary Tree/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode le原创 2020-07-24 06:45:23 · 53 阅读 · 0 评论 -
1022. Sum of Root To Leaf Binary Numbers
1022. Sum of Root To Leaf Binary Numbers/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int原创 2020-07-24 02:05:33 · 111 阅读 · 0 评论 -
965. Univalued Binary Tree
965. Univalued Binary Tree/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode原创 2020-07-23 05:41:16 · 72 阅读 · 0 评论 -
559. Maximum Depth of N-ary Tree
559. Maximum Depth of N-ary Tree/*// Definition for a Node.class Node { public int val; public List<Node> children; public Node() {} public Node(int _val) { val = _val; } public Node(int _val, List<Node> _c原创 2020-07-23 00:16:31 · 60 阅读 · 0 评论 -
897. Increasing Order Search Tree
897. Increasing Order Search Tree/** * Definition for a binary tree node. * public class TreeNode { * ; int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val,原创 2020-07-22 08:02:26 · 75 阅读 · 0 评论 -
590. N-ary Tree Postorder Traversal
590. N-ary Tree Postorder Traversal/*// Definition for a Node.class Node { public int val; public List<Node> children; public Node() {} public Node(int _val) { val = _val; } public Node(int _val, List<Node>原创 2020-07-22 03:37:54 · 77 阅读 · 0 评论 -
589. N-ary Tree Preorder Traversal
589. N-ary Tree Preorder Traversal/*// Definition for a Node.class Node { public int val; public List<Node> children; public Node() {} public Node(int _val) { val = _val; } public Node(int _val, List<Node>...原创 2020-07-22 00:44:03 · 62 阅读 · 0 评论 -
1038. Binary Search Tree to Greater Sum Tree
1038. Binary Search Tree to Greater Sum Tree/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode原创 2020-07-21 04:42:05 · 68 阅读 · 0 评论