|
马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
- 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.
复制代码
- /**
- * 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;
- }
-
- return generateInt(root);
- }
-
- public int generateInt(TreeNode root){
-
- if(root != null)
- return (1 + Math.max(generateInt(root.left),generateInt(root.right)));
- else
- return 0;
-
- }
- }
复制代码 |
|