LeetCode 104 Maximum Depth of Binary Tree题解
来源:互联网 发布:数据库管理发展三阶段 编辑:程序博客网 时间:2024/05/17 05:14
题目地址:https://leetcode.com/problems/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.
二叉树的最大深度,就是从根节点到最远的叶节点经过的节点数。
算法设计:
采用递归遍历思想,遍历到叶节点停止,开始回溯,每次回溯都取左右子树深度比较大的那个。
Java代码实现:
/** * 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; int l=maxDepth(root.left); int r=maxDepth(root.right); return l>r?l+1:r+1; }}
0 0
- LeetCode题解:Maximum Depth of Binary Tree
- LeetCode题解:Maximum Depth of Binary Tree
- LeetCode题解: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: 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
- LeetCode 104 Maximum Depth of Binary Tree
- leetcode || 104、Maximum Depth of Binary Tree
- LeetCode 104: Maximum Depth of Binary Tree
- CCF计算机软件能力认证模拟试题(c/c++)
- Leetcode_Two Sum
- 一个人
- zzu 10452: "分"数(控制数量的01背包)@
- 含继承在内的初始化过程 ——《Thinking in java》 读书笔记之一
- LeetCode 104 Maximum Depth of Binary Tree题解
- 欢迎使用CSDN-markdown编辑器
- 使用Geogebra和Tikz作图
- ImageLoader总结
- noip2016(tg)题解
- jemalloc 3.6.0源码详解—[3]Run and bins
- Android笔记——adb指令
- 图的遍历
- endnote 使用方法