[leetcode]_Maximum Depth of Binary Tree

第三道树的题目，我还是不会，我擦，怎么递归算法还是不能很好理解。看来还得好好研究下递归算法。

题目：求一棵树的最大深度。

思路：递归地求取左子树最大深度和右子树最大深度，返回较大值即为整棵树的最大深度。

代码：

public int maxDepth(TreeNode root) {

        if(root == null) return 0;
int leftHeight = 1,rightHeight = 1;

        if(root.left != null) leftHeight += maxDepth(root.left);

        if(root.right != null) rightHeight += maxDepth(root.right);

        if(leftHeight > rightHeight) return leftHeight;

        else return rightHeight;

    }

[leetcode]_Maximum Depth of Binary Tree,布布扣,bubuko.com

时间： 2024-10-13 23:31:35

[leetcode]_Maximum Depth of Binary Tree的相关文章

[leetcode]Minimum Depth of Binary Tree @ Python

原题地址:http://oj.leetcode.com/problems/minimum-depth-of-binary-tree/ 题意: 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. 解题思路:分几种情况考虑:1,树为空,

LeetCode: 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. 题解: 题意比较清楚, 找到从root出发最长的一条路径的长度. 采用DFS即可. 相似的一道题: Minimux Depth of Binary Tree 解法: http://

LeetCode——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. 此题和求二叉树的最短路径几乎一模一样. public int maxDepth(TreeNode root) { if (root == null) return 0; int a

leetcode——Maximum Depth of Binary Tree （递归，）

Maximum Depth of Binary Tree Total Accepted: 59837 Total Submissions: 132940My Submissions Question Solution 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 f

leetcode Maximum Depth of Binary Tree

代码: /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: int max; void deepSearch(TreeNode * root, int dep

[LeetCode] Maximum Depth of Binary Tree dfs,深度搜索

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. Hide Tags Tree Depth-first Search 简单的深度搜索 #include <iostream> using namespace std; /** *

[leetcode] Minimum Depth of Binary Tree ,到叶子节点的最小距离（python）

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. class Solution: # @param root, a tree node # @return an integer minDep =-1 def minDepth(se

leetcode Minimum Depth of Binary Tree C++题解

题目描述 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. 给出一个二叉树,求其最短路径最短路径定义:从根节点到最近的叶子节点的路径上的节点个数思路描述这道题对于我来说引发的思考比较多首先明确一个比较大但很重要的概念,二叉

LeetCode | Minimum Depth of Binary Tree

题目:给定一个二叉树,找到其最小深度.最小深度是从根节点到最近叶节点的最短路径的节点数. 1 /** 2 * Definition for binary tree 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */ 10 /** 11 最小深度为:根节点到达最近叶节点的最短路径 12 总体思想是:左子树