[LeetCode]104. Maximum Depth of Binary Tree
来源：互联网 发布：mac怎么远程协助 编辑：程序博客网 时间：2024/05/13 06:01
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;else{if(root.left == null && root.right == null) return 1;else {int dl = maxDepth(root.left);int dr = maxDepth(root.right);return dl>dr?dl+1:dr+1;}}}} 0 0
- [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
- 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
- android线程优化
- maven学习.1
- linux 命令学习之 (nohup)
- [解决] User [dr.who] is not authorized to view the logs for application
- C#在线程池中调用委托
- [LeetCode]104. Maximum Depth of Binary Tree
- C++学习之继承和派生
- dell服务器poweredge T620装ubuntu很卡显卡驱动有问题（matrox g200er2显卡）
- 读 支持向量机建模与应用
- LightOJ 1050 - Marbles【概率】
- 通过命令的方式编译web project
- android系统各种音量的获取与设置
- [LeetCode]226. Invert Binary Tree
- [LeetCode]173. Binary Search Tree Iterator
