【[leetcode tree]104. Maximum Depth of Binary Tree】的更多相关文章

【LeetCode】104. Maximum Depth of Binary Tree (2 solutions)

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. 与Minimum Depth of Binary Tree对照看 解法一:递归,子树高度+1. /** * Defini…

【一天一道LeetCode】#104. Maximum Depth of Binary Tree

一天一道LeetCode 本系列文章已全部上传至我的github,地址:ZeeCoder's Github 欢迎大家关注我的新浪微博,我的新浪微博 欢迎转载,转载请注明出处 (一)题目 来源: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 th…

【LeetCode】104. Maximum Depth of Binary Tree 解题报告（Python）

作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录 题目描述 题目大意 解题方法 方法一:BFS 方法二:DFS 参考资料 日期 题目地址:https://leetcode.com/problems/maximum-depth-of-binary-tree/ Total Accepted: 85334 Total Submissions: 188240 Difficulty: Easy 题目描述 Given a binary tr…

【LeetCode】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. Solution: /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNo…

LeetCode OJ 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; *…

LeetCode：104 Maximum Depth of Binary Tree(easy)

题目: 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. 代码:…

LeetCode之104. Maximum Depth of Binary Tree

-------------------------------- 递归遍历即可 AC代码: /** * 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…

[leetcode tree]104. Maximum Depth of Binary Tree

求树的最大深度 class Solution(object): def maxDepth(self, root): if not root: return 0 left = self.maxDepth(root.left) right = self.maxDepth(root.right) return left+1 if left>right else right+1 1 line python class Solution(object): def maxDepth(self, root):…

LeetCode Javascript实现 258. Add Digits 104. Maximum Depth of Binary Tree 226. Invert Binary Tree

258. Add Digits Digit root 数根问题 /** * @param {number} num * @return {number} */ var addDigits = function(num) { var b = (num-1) % 9 + 1 ; return b; }; //之所以num要-1再+1;是因为特殊情况下:当num是9的倍数时,0+9的数字根和0的数字根不同. 性质说明 1.任何数加9的数字根还是它本身.(特殊情况num=0)        小学学加法的…

LeetCode 104. Maximum Depth of Binary Tree C++ 解题报告

104. Maximum Depth of Binary Tree -- Easy 方法 使用递归 /** * 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…