Algorithm - 求二叉树的最大深度

 1         int MaxDepth(Node n)
 2         {
 3             if (!n.left && !n.right)
 4                 return 1;
 5 
 6             int l = 0;
 7             if (n.left)
 8                 l = MaxDepth(n.left) + 1;
 9 
10             int r = 0;
11             if (n.right)
12                 r = MaxDepth(n.right) + 1;
13 
14             return Max(l, r);
15         }

 

转载于:https://www.cnblogs.com/mend/archive/2012/04/09/2439486.html