104. Maximum Depth of Binary Tree
来源:互联网 发布:淘宝优惠券平台排名 编辑:程序博客网 时间:2024/06/14 18:28
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; return 1 + Math.max(maxDepth(root.left), maxDepth(root.right)); }}
阅读全文
0 0
- [LeetCode]104.Maximum Depth of Binary Tree
- 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
- 104. Maximum Depth of Binary Tree
- 104.Maximum Depth of Binary Tree
- 104. Maximum Depth of Binary Tree
- 104. Maximum Depth of Binary Tree
- leetCode 104. Maximum Depth of Binary Tree
- 104. Maximum Depth of Binary Tree
- 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 实现自定义闹钟
- 系统时钟SYSCLK、HSE、HSI的讲解之《晶振与震荡电路的介绍》
- 原生js实现自定义事件
- 排序算法总结
- Timeline时间轴
- 104. Maximum Depth of Binary Tree
- 游戏开发中的人工智能(十):模糊逻辑
- 图像特征提取优秀的文章帖子
- 留校第一周
- 423D
- Ubuntu 下搭建 Nginx + PHP 运行
- Retrofit基本用法
- display:none和visibility:hidden的区别
- 多态、内部类、Object、异常