/**
* 104. Maximum Depth of Binary Tree
* @param root
* @return
* 2017年3月3日上午11:16:00
*/
public int maxDepth(TreeNode root) {
TreeNode pTreeNode = root;
if (pTreeNode == null)
return 0;
else {
int leftDep = maxDepth(pTreeNode.left)+1;
int rightDep = maxDepth(pTreeNode.right)+1;
return leftDep>=rightDep?leftDep:rightDep;
}
}
leetcode 104. Maximum Depth of Binary Tree
最新推荐文章于 2023-11-09 13:10:38 发布