2021-09-27（剑指 Offer 55 - I. 二叉树的深度）

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

标签：27,TreeNode,Offer,int,right,二叉树,maxDepth,root,left
来源： https://blog.csdn.net/TickTick123/article/details/120506352