求二叉树中节点的最大距离（递归算法）

上一篇的《求二叉树中节点的最大距离 》显得有点走火入魔了，参考过别人的算法解释，事实上不需要考虑得那么复杂。使用以下C代码就可以解决了。

/* * return the depth of the tree */ int get_depth(Tree *tree) { int depth = 0; if ( tree ) { int a = get_depth(tree->left); int b = get_depth(tree->right); depth = ( a > b ) ? a : b; depth++; } return depth; } /* * return the max distance of the tree */ int get_max_distance(Tree *tree) { int distance = 0; if ( tree ) { // get the max distance connected to the current node distance = get_depth(tree->left) + get_depth(tree->right); // compare the value with it's sub trees int l_distance = get_max_distance(tree->left); int r_distance = get_max_distance(tree->right); distance = ( l_distance > dis