代码演示：
package swordfingeroffer
;
public class InterviewQuestion55 {
public int deepthTree(TreeNode root
) {
if (null
== root
) {
return 0;
}
int nLeftTree
= deepthTree(root
.left
);
int nRightTree
= deepthTree(root
.right
);
return (nLeftTree
> nRightTree
) ? (nLeftTree
+ 1) : (nRightTree
+ 1);
}
}
Processed:
0.012, SQL:
12
