摘要：
参考：http://blog.csdn.net/njdragonfly/article/details/6373199 阅读全文
posted @ 2017-05-15 23:20
wxquare
阅读(322)
评论(0)
推荐(0)
摘要：
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 an 阅读全文
posted @ 2017-05-15 22:57
wxquare
阅读(1706)
评论(0)
推荐(0)
摘要：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: But the fol 阅读全文
posted @ 2017-05-15 22:50
wxquare
阅读(633)
评论(0)
推荐(0)
摘要：
用递归方法计算二叉树的最大、最小深度，注意他们之间的区别 Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the roo 阅读全文
posted @ 2017-05-15 22:21
wxquare
阅读(1507)
评论(0)
推荐(0)
摘要：
二叉树的构建必须要有中序遍历，另外还需要前序和后续中的一种。下面分别是有前序和中序、后续和中序采用递归方法构建二叉树的过程 阅读全文
posted @ 2017-05-15 21:04
wxquare
阅读(309)
评论(0)
推荐(0)
浙公网安备 33010602011771号