bianry tree DFS
文章平均质量分 65
yoohoosome
这个作者很懒,什么都没留下…
展开
-
[刷题]Binary Tree Maximum Path Sum
[LintCode]Binary Tree Maximum Path Sum/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *原创 2015-03-23 19:42:35 · 430 阅读 · 1 评论 -
[刷题]Balanced Binary Tree
[LintCode]Balanced Binary Tree/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { * this.v原创 2015-03-23 17:03:30 · 324 阅读 · 1 评论 -
[刷题]Maximum Depth of Binary Tree
[LintCode]Maximum Depth of Binary Tree/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *原创 2015-03-23 14:46:59 · 312 阅读 · 1 评论 -
[刷题]Binary Tree Preorder Traversal
[LintCode]Binary Tree Preorder Traversal答案/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *原创 2015-03-22 16:06:03 · 287 阅读 · 1 评论 -
[刷题]Lowest Common Ancestor
[LintCode]Lowest Common Ancestor/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { * th原创 2015-03-23 21:44:36 · 334 阅读 · 1 评论 -
[刷题]Binary Tree Postorder Traversal
[LintCode]Binary Tree Postorder Traversal/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *原创 2015-03-22 17:21:58 · 295 阅读 · 1 评论 -
[刷题]Binary Tree Inorder Traversal
[LintCode]Binary Tree Inorder Traversal/** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *原创 2015-03-22 17:17:26 · 280 阅读 · 1 评论 -
[刷题]Construct Binary Tree from Preorder and Inorder Traversal
[刷题]Construct Binary Tree from Preorder and Inorder Traversal /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public T原创 2015-07-22 10:28:35 · 316 阅读 · 1 评论