剑指Offer_38_二叉树的深度

题目描述

解题思路

实现

/*树结点的定义*/
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
};
/*实现*/
public class Solution {
public int TreeDepth(TreeNode pRoot)
{
if (pRoot == null) return 0;
int left = TreeDepth(pRoot.left);
int right = TreeDepth(pRoot.right);
return 1 + ((left > right) ? left : right);
}
}