38二叉树的深度

题目描述

public class Solution {
public int TreeDepth(TreeNode root) {
return depth(root);
}
private int depth(TreeNode root){
if(root==null) return 0;
int left = depth(root.left);
int right = depth(root.right);
if(left>right) return left+1;
else return right+1;

}
}