这道题是LeetCode里的第104道题. 给出题目: 给定一个二叉树,找出其最大深度. 二叉树的深度为根节点到最远叶子节点的最长路径上的节点数. 说明: 叶子节点是指没有子节点的节点. 示例: 给定二叉树 [3,9,20,null,null,15,7], 3 / \ 9 20 / \ 15 7 返回它的最大深度 3 . DFS 递归算法,简单的二叉树题.如果看不懂代码,建议学习一下二叉树,这可是基础啊! 给出代码: 递归法: /** * Definition for a binary tree…

http://oj.leetcode.com/problems/maximum-depth-of-binary-tree/ public class Solution { public int maxDepth(TreeNode root) { if(root!=null){ int depth=0; InOrder(root,depth); } return max; } public int max=0; private void InOrder(TreeNode root, int dep…

[LeetCode]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. 递归和非递归,此提比较简单.广度优先遍历即可.关键之处就在于如何保持访问深度. 下面是4种代码: im…

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. 递归解题思路: ①结点为空时,返回0:②当前结点的深度 = max(两个孩子结点各自最大深度)+ 1 /** * Definition for binary tree * stru…

题目简述: 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. 解题思路: # Definition for a binary tree node # class TreeNode: # def __init__(self, x):…

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. 简单题,不过注意叶子结点是两个子树都是NULL的指针.只有一个子树NULL的不是. struct TreeNode { int val; TreeNode *left; TreeN…

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. 求二叉树的高度,即从根节点到叶节点上所有节点的数量. 解题思路: 这题是难度系数1,频率1的题目……用到的知识点是二叉树D…

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. BFS碰到一个叶子结点就可以了. class Solution { public: int minDepth(TreeNo…

Maximum Depth of Binary Tree Total Accepted: 63668 Total Submissions: 141121 My 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…

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…