104. Maximum Depth of Binary Tree [easy] (Python)
来源:互联网 发布:mac 浏览照片 下一张 编辑:程序博客网 时间:2024/06/06 07:38
题目链接
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.
题目翻译
给定一个二叉树,求其最大深度。
最大深度指的是,从根节点到最远的叶子节点的最长路径的节点个数。
思路方法
思路一
深度优先搜索(DFS),递归求解。
代码
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): def maxDepth(self, root): """ :type root: TreeNode :rtype: int """ if root == None: return 0 return 1 + max(self.maxDepth(root.left), self.maxDepth(root.right))
思路二
广度优先搜索(BFS),利用队列求解。
代码
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): def maxDepth(self, root): """ :type root: TreeNode :rtype: int """ if root == None: return 0 depth = 0 q = [root] while len(q) != 0: depth += 1 for i in range(0, len(q)): if q[0].left: q.append(q[0].left) if q[0].right: q.append(q[0].right) del q[0] return depth
说明
作为这个问题的对比,类似问题:Minimum Depth of Binary Tree
PS: 新手刷LeetCode,新手写博客,写错了或者写的不清楚还请帮忙指出,谢谢!
转载请注明:http://blog.csdn.net/coder_orz/article/details/51337420
0 0
- 104. Maximum Depth of Binary Tree [easy] (Python)
- 104. Maximum Depth of Binary Tree (Easy)
- 【leetcode】【Easy】【104. Maximum Depth of Binary Tree】【tree】
- Maximum Depth of Binary Tree(easy)
- Leetcode----104. Maximum Depth of Binary Tree(easy)
- Easy-题目3:104. Maximum Depth of Binary Tree
- Leetcode 104. Maximum Depth of Binary Tree (Easy) (cpp)
- LeetCode解题报告 104. Maximum Depth of Binary Tree [easy]
- leetcode-Maximum Depth of Binary Tree-python
- 【Leetcode】【python】Maximum Depth of Binary Tree
- python--leetcode104. Maximum Depth of Binary Tree
- [leetcode: Python]104. Maximum Depth of Binary Tree
- [Leetcode 104, Easy] Minimum (Maximum) Depth of Binary Tree
- 【LeetCode】(104)Maximum Depth of Binary Tree(Easy)
- Easy 104题 Maximum Depth of Binary Tree
- LeetCode #104 - Maximum Depth of Binary Tree - Easy
- Maximum Depth of Binary Tree——Difficulty:Easy
- 【Leetcode-easy-104】Maximum Depth of Binary Tree
- [kuangbin带你飞]专题一 简单搜索 -G - Shuffle'm Up
- Leetcode 18. 4Sum
- Jquery使用Ajax请求调用后台
- 无障碍开发系列之事件统一
- Android 应用程序发布流程---碗豆荚发布流程
- 104. Maximum Depth of Binary Tree [easy] (Python)
- 【深入理解JVM】:Java内存模型JMM
- IOS开发:截取当前视图
- 杭电oj~~2008
- 剑指offer 面试题 (替换空格)(1)
- 无障碍开发系列之WAI-ARIA
- POJ 2774 后缀数组水题
- Adaptive design
- 给 Android 开发者的 RxJava 详解