【Leetcode-easy-104】Maximum Depth of Binary Tree
来源:互联网 发布:域名备案查询官网 编辑:程序博客网 时间:2024/06/05 11:37
【Leetcode-easy-104】Maximum Depth of Binary Tree
题目
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; } * } */class Solution { public int maxDepth(TreeNode root) { if (root == null) return 0; int left = maxDepth(root.left); int right = maxDepth(root.right); return Math.max(left, right)+1; }}
声明:题目来自Leetcode。
阅读全文
0 0
- [Leetcode 104, Easy] Minimum (Maximum) Depth of Binary Tree
- 【LeetCode】(104)Maximum Depth of Binary Tree(Easy)
- LeetCode #104 - Maximum Depth of Binary Tree - Easy
- 【Leetcode-easy-104】Maximum Depth of Binary Tree
- 【leetcode】【Easy】【104. Maximum Depth of Binary Tree】【tree】
- Leetcode----104. Maximum Depth of Binary Tree(easy)
- Leetcode 104. Maximum Depth of Binary Tree (Easy) (cpp)
- LeetCode解题报告 104. Maximum Depth of Binary Tree [easy]
- LeetCode-Easy刷题(21) 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: Maximum Depth of Binary Tree [104]
- 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
- 既是质数也是回文数
- 你好迪拜!今天我在GITEX 2017,锐捷在海外扬帆远航!
- 【头条】深度解读DataZoo四大优势 荣之联大数据的探索和创新
- Spark源码走读(一) —— Spark应用提交流程
- C++之数字容器装水问题(10)---《那些奇怪的算法》
- 【Leetcode-easy-104】Maximum Depth of Binary Tree
- Jzoj4713 A
- Python之内存管理机制
- HDU 5985 Lucky Coins(概率)
- ROS_6
- java并发编程实践第二遍笔记(-)
- C++多态性
- linux Centos或者redhat安装MariaDB
- 【程序员学习心得】学习JS的收获