leetcode中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.

问题描述

求解二叉树的深度问题

C++代码

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL)
 * };
 */
class Solution {
public:
    int max(int a,int b){
        return a > b? a : b;
    }
    int maxDepth(TreeNode *root) {
        int len = 0;
        if (root == NULL) return 0;

        return max(maxDepth(root->left)+1,maxDepth(root->right)+1);
    }
};

java代码

/**
 * 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 root) {
        if (root == null) return 0;
        return (Math.max(maxDepth(root.left)+1, maxDepth(root.right)+1));
    }
}