随笔分类 -  Binary Tree

199. Binary Tree Right Side View
摘要：class Solution { public List rightSideView(TreeNode root) { List res=new ArrayList(); rightView(root, res, 0); return res; } private void rightView(TreeNode node, ... 阅读全文
posted @ 2017-10-26 01:31 Weiyu Wang 阅读(135) 评论(0) 推荐(0)
145. Binary Tree Postorder Traversal
摘要：class Solution { public List postorderTraversal(TreeNode root) { Stack stack=new Stack(); List res=new ArrayList(); while(root!=null||!stack.isEmpty()) { ... 阅读全文
posted @ 2017-10-17 03:21 Weiyu Wang 阅读(114) 评论(0) 推荐(0)
144. Binary Tree Preorder Traversal
摘要：class Solution { public List preorderTraversal(TreeNode root) { Stack stack=new Stack(); List res=new ArrayList(); while(root!=null||!stack.isEmpty()) { ... 阅读全文
posted @ 2017-10-12 06:04 Weiyu Wang 阅读(81) 评论(0) 推荐(0)
129. Sum Root to Leaf Numbers
摘要：class Solution { public int sumNumbers(TreeNode root) { return sumNumber("", root); } private int sumNumber(String str, TreeNode node){ if(node==null) return 0... 阅读全文
posted @ 2017-10-04 05:44 Weiyu Wang 阅读(129) 评论(0) 推荐(0)
117. Populating Next Right Pointers in Each Node II
摘要：public class Solution { public void connect(TreeLinkNode root) { TreeLinkNode lstart=new TreeLinkNode(0); while(root!=null) { TreeLinkNode cur=lstart; ... 阅读全文
posted @ 2017-09-30 09:16 Weiyu Wang 阅读(117) 评论(0) 推荐(0)
116. Populating Next Right Pointers in Each Node
摘要：public class Solution { public void connect(TreeLinkNode root) { TreeLinkNode startNode=root; while(startNode!=null) { TreeLinkNode node=startNode; ... 阅读全文
posted @ 2017-09-30 04:54 Weiyu Wang 阅读(126) 评论(0) 推荐(0)
114. Flatten Binary Tree to Linked List
摘要：class Solution { public void flatten(TreeNode root) { TreeNode cur=root, pre=null; while(cur!=null) { if(cur.left!=null) { pre=cur.... 阅读全文
posted @ 2017-09-30 04:06 Weiyu Wang 阅读(143) 评论(0) 推荐(0)
106. Construct Binary Tree from Inorder and Postorder Traversal
摘要：public class Solution { public TreeNode buildTree(int[] inorder, int[] postorder) { return buildTree(inorder, 0, inorder.length-1, postorder, 0, postorder.length-1); } private TreeNo... 阅读全文
posted @ 2017-09-29 12:30 Weiyu Wang 阅读(112) 评论(0) 推荐(0)
103. Binary Tree Zigzag Level Order Traversal
摘要：class Solution { public List> zigzagLevelOrder(TreeNode root) { List> res=new ArrayList>(); if(root==null) return res; Queue queue=new LinkedList(); Li... 阅读全文
posted @ 2017-09-29 11:36 Weiyu Wang 阅读(122) 评论(0) 推荐(0)
102. Binary Tree Level Order Traversal
摘要：class Solution { public List> levelOrder(TreeNode root) { List> res=new ArrayList>(); if(root==null) return res; Queue queue=new LinkedList(); queue.ad... 阅读全文
posted @ 2017-09-29 11:27 Weiyu Wang 阅读(124) 评论(0) 推荐(0)
99. Recover Binary Search Tree
摘要：class Solution { public void recoverTree(TreeNode root) { TreeNode cur=root,pre=null,node1=null,node2=null, p=null; while(cur!=null) { if(cur.left!=null) ... 阅读全文
posted @ 2017-09-29 10:01 Weiyu Wang 阅读(106) 评论(0) 推荐(0)
98. Validate Binary Search Tree
摘要：public class Solution { public boolean isValidBST(TreeNode root) { Stack stack=new Stack(); TreeNode cur=null; while(root!=null||!stack.isEmpty()) { ... 阅读全文
posted @ 2017-09-29 06:32 Weiyu Wang 阅读(144) 评论(0) 推荐(0)
94. Binary Tree Inorder Traversal
摘要：public class Solution { public List inorderTraversal(TreeNode root) { List res=new ArrayList(); Stack stack=new Stack(); while(root!=null||!stack.isEmpty()) { ... 阅读全文
posted @ 2017-09-29 02:01 Weiyu Wang 阅读(168) 评论(0) 推荐(0)