标签：for code maximum treenode path des imu return content
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.
Note: A leaf is a node with no children.
Example:
Given binary tree [3,9,20,null,null,15,7],
3
/ 9 20
/ 15 7
return its depth = 3.
1 /** 2 * Definition for a binary tree node. 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */ 10 public class Solution { 11 public int maxDepth(TreeNode root) { 12 if (root == null) return 0; 13 return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1; 14 } 15 }
标签：for code maximum treenode path des imu return content
原文地址：https://www.cnblogs.com/beiyeqingteng/p/10468674.html
