1
《编程之美: 求二叉树中节点的最大距离》的另一个解法
http://www.cnblogs.com/miloyip/archive/2010/02/25/binary_tree_distance.html2.二叉树的深度优先遍历与广度优先遍历 [ C++ 实现 ]:http://www.blogjava.net/fancydeepin/archive/2013/02/03/395073.html
1
2.二叉树的深度优先遍历与广度优先遍历 [ C++ 实现 ]:http://www.blogjava.net/fancydeepin/archive/2013/02/03/395073.html