LeetCode 104Maximum 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.

题目比较简单,直接使用递归的方法就能直接解决.当然还用更好的方法,这个学习完之后再进行分享

java

 * Definition for a binary tree node.
 * 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;

        int l = maxDepth(root.left);
        int r = maxDepth(root.right);
        return l > r ? l + 1 : r + 1;

    }
}

c语言

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
int maxDepth(struct TreeNode* root) {

    if(root == NULL) return 0;

    int r = maxDepth(root -> right);
    int l = maxDepth(root -> left);
    return r > l ? r + 1 : l + 1;
}