【Leetcode】：104. Maximum Depth of Binary Tree 问题 in JAVA
来源：互联网 发布：塞班3软件下载 编辑：程序博客网 时间：2024/05/16 06:45
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.
/** * 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; } if (root.left == null && root.right == null) { return 1; } int l = maxDepth(root.left); int r = maxDepth(root.right); return l>=r ? l+1 : r+1; }} 0 0
- 【Leetcode】：104. Maximum Depth of Binary Tree 问题 in JAVA
- [Leetcode] Maximum Depth of Binary Tree (Java)
- [LeetCode][Java] Maximum Depth of Binary Tree
- LeetCode|Maximum Depth of Binary Tree-java
- (java)leetcode Maximum Depth of Binary Tree
- leetcode：Maximum Depth of Binary Tree 【Java】
- [LeetCode]104.Maximum Depth of Binary Tree
- 【LeetCode】104.Maximum Depth of Binary Tree
- [Leetcode] 104. Maximum Depth of Binary Tree
- LeetCode --- 104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- leetCode 104. Maximum Depth of Binary Tree
- 104. Maximum Depth of Binary Tree LeetCode
- 104. Maximum Depth of Binary Tree LeetCode
- LeetCode 104. Maximum Depth of Binary Tree
- leetcode：104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- [LeetCode]104. Maximum Depth of Binary Tree
- Android面试题（二）
- 14-Reverse Integer
- hdoj-1796-How many integers can you find
- mac osx下jetbrains家 IDE 开发工具 错误修复 优化
- 有关指针初始化的误区
- 【Leetcode】：104. Maximum Depth of Binary Tree 问题 in JAVA
- jfreechart 问题
- Tempter of the Bone
- Logistic Function
- 数据结构之快慢指针查找链表中间结点
- java字符串中如何显示双引号
- 深入源码解析Android中的Handler,Message,MessageQueue,Looper
- POJ 2431 Expedition
- 成功整合dede与ucenter详细步骤
