Leetcode#104. Maximum Depth of Binary Tree(最大二叉树的深度)

题目

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.

题意

给你一个二叉树，求出二叉树的最大的深度。

分析

递归模型为：

• f(root)==0 root==NULL
• f(root) =max(f(root->left),f(root->right)) + 1 其他情况

Python语言

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def maxDepth(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        if root == None:
            return 0
        else:
            lh = self.maxDepth(root.left)
            rh = self.maxDepth(root.right)
            return max(lh,rh)+1

C++语言

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:

    int maxDepth(TreeNode* root) 
    {
         int lh, rh;
        if(root==NULL)
            return 0;
        else
        {
            //左子树的深度
            lh = maxDepth(root->left);
            //右子树的深度
            rh = maxDepth(root->right);
            //求最大深度，只有根节点时，lh =0, rh =0 ,不满足lh>rh返回 rh+1=1
           // return (lh>rh)?(lh+1):(rh+1);
            return max(lh,rh)+1;
        }

    }
};