二叉树
文章平均质量分 72
一圈儿的云
爱摇滚,爱编程,爱java,喜欢钻研算法,和所有软件工程师一样,希望凭自己的努力改变世界
展开
-
关于二叉树后续遍历算法的一点思考
二叉树的三种遍历方式,最贱的那个原创 2014-04-15 18:19:35 · 527 阅读 · 0 评论 -
Minimum Depth of Binary Tree 二叉树最小深度
///** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { pub原创 2014-04-17 22:46:04 · 669 阅读 · 0 评论 -
二叉树最大 最小深度
二叉树求最大,最小深度是二叉树很基本的问题。在此给出原创 2014-04-22 12:30:54 · 1106 阅读 · 0 评论 -
Binary Trees 斯坦福教育库
Binary Treesby Nick ParlanteThis article introduces the basic concepts of binary trees, and then works through a series of practice problems with solution code in C/C++ and Java. Binary trees原创 2014-04-18 20:39:28 · 1114 阅读 · 0 评论 -
Sum Root to Leaf Numbers 求路径之和
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.Find the tota原创 2014-04-25 20:42:26 · 573 阅读 · 0 评论 -
Balanced Binary Tree 平衡二叉树的检验
检验二叉树是否为Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node nev原创 2014-05-13 16:11:04 · 896 阅读 · 0 评论 -
Same Tree判断二叉树相等
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.验证二叉树原创 2014-05-13 17:30:01 · 626 阅读 · 0 评论