[Leetcode] 104. Maximum Depth of Binary Tree
来源:互联网 发布:mac 双屏 dock 切换 编辑:程序博客网 时间:2024/06/03 11:25
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 binary tree * 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; return Math.max(maxDepth(root.left), maxDepth(root.right)) + 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
- 下载资源收集,持续更新
- IOS POST参数 需要处理特殊字符
- cubieboard nand重新分区扩容
- [Leetcode] 103. Binary Tree Zigzag Level Order Traversal
- leetcode--Max Points on a Line
- [Leetcode] 104. Maximum Depth of Binary Tree
- JQuery简单表单验证
- ASP.NET Ueditor上传图片添加水印
- 方程的解数
- UVa 10005 - Packing polygons
- 计数排序
- AWK的基本使用
- 运行oracle 的aix、linux主机改ip规范
- 分类器训练的过拟合问题和处理方法【未整理完成】