Maximum Depth of Binary Tree

最新推荐文章于 2020-12-01 23:52:02 发布

完美世界xx

最新推荐文章于 2020-12-01 23:52:02 发布

阅读量415

点赞数

分类专栏： Leetcode 文章标签： Java leetcode algorithm 递归

本文链接：https://blog.csdn.net/xiang1431/article/details/39429085

版权

Leetcode 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

<p>/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
  public int maxDepth(TreeNode p) {
                if(p==null)return 0;                
                int leftTreeDepth,rightTreeDepth;                              
                leftTreeDepth=maxDepth(p.left);                
                rightTreeDepth=maxDepth(p.right);                
                return leftTreeDepth>rightTreeDepth?leftTreeDepth+1:rightTreeDepth+1;       
                }</p><p>}</p>