LeetCode-Maximum Depth of Binary Tree

最新推荐文章于 2016-11-28 13:06:27 发布
最新推荐文章于 2016-11-28 13:06:27 发布
阅读量219 收藏
点赞数 1
分类专栏： LeetCode 文章标签： 二叉树 递归
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/dancheren/article/details/52883054
版权

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.

此题是最近本的二叉树递归题，使用有限深度比较一个节点左右子树的深度，选择较大的子树深度作为返回值。

代码如下：


dancheren
关注
专栏目录
java-leetcode-maximum-depth-of-binary-tree
08-13
java java_leetcode-maximum-depth-of-binary-tree
python-leetcode题解之104-Maximum-Depth-of-Binary-Tree
最新发布
09-04
python python_leetcode题解之104_Maximum_Depth_of_Binary_Tree
四平方和定理leetcode-leetcode-practice:个人LeetCode练习代码
06-30
104.maximum-depth-of-binary-tree (二叉树的最大深度) 105.construct-binary-tree-from-preorder-and-inorder-traversal (从前序与中序遍历序列构造二叉树) 106.construct-binary-tree-from-inorder-and-postorder-...
leetcode答案-leetcode-java:leetcode的Java代码
06-30
leetcode 答案leetcode-java leetcode.com 的 Java 答案 ================索引================ com.leetcode.array Search a 2D Matrix Spiral Matrix com.leetcode.list Linked List Cycle Linked List Cycle II ...
2sumleetcode-LeetCode:力码
07-07
2sum leetcode 轮廓 1_count_and_say.cpp - super_ugly_number.cpp - Detect_Pattern.cpp - degree_of_array.cpp ...2Sum_Data_Structure_Design.cpp ...Remove_Nth_Node_From_End_of_List.cpp ...Maximum_Depth_B
LeetCode-Path Sum III
单车人的博客
11-23 382
You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need to start or end at the root or a leaf, but it
LeetCode-Reverse Words in a String
单车人的博客
09-20 315
题目： Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". Update (2015-02-12): For C programmers: Try to solve it in
LeetCode-Path Sum II
单车人的博客
11-23 312
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree and sum = 22, 5 / \
LeetCode-First Unique Character in a String
单车人的博客
09-13 310
题目： Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2.
LeetCode-ZigZag Conversion
单车人的博客
09-01 310
原题陈述： The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A
LeetCode-Spiral Matrix
单车人的博客
10-13 302
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example, Given the following matrix: [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ]
LeetCode-Rotate Function
单车人的博客
10-16 296
Given an array of integers A and let n to be its length. Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a "rotation function" F on A as follow:
LeetCode-Minimum Depth of Binary Tree
单车人的博客
11-28 282
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. 解题思路在代码注释中说明。 代码如下： /** * D
LeetCode-Integer to Roman
单车人的博客
10-21 280
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 罗马数字组成单元： I: 1 IV: 4 V: 5 IX: 9 X: 10 XL: 40 L: 50 XC: 90 C: 10
LeetCode-House Robber
单车人的博客
09-21 269
题目： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjac
LeetCode-Symmetric Tree
单车人的博客
11-25 265
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3
LeetCode-Maximum Subarray
单车人的博客
10-13 265
Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] ha
LeetCode-Binary Tree Level Order Traversal
单车人的博客
11-25 259
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree [3,9,20,null,null,15,7], 3 / \ 9 20
LeetCode-Reverse Integer
单车人的博客
09-04 254
题目： Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here are some good questions to ask
idea leetcode-edito乱码
09-01
LeetCode-Editor是一种在线编码工具，它提供了一个用户友好的界面编写和运行代码。在使用LeetCode-Editor时，有时候会出现乱码的问题。 乱码的原因可能是由于编码格式不兼容或者编码错误导致的。在这种情况下，我们...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值