Depth-first Search
konsy_dong
Java,C++,Python,linux
展开
-
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.思路: 使用递归求解非常容易,一个节点的深度等于它的左子树的深度和它的右子原创 2017-04-04 16:20:01 · 342 阅读 · 0 评论 -
LeetCode 111. 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.思路: 找出最小深度,最小深度是叶节点到根节点的最短路径,如果根节点没有叶原创 2017-04-09 11:22:11 · 234 阅读 · 0 评论 -
LeetCode 112. Path Sum
题目: Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example: Given the below binary tree and su原创 2017-04-20 12:49:45 · 323 阅读 · 0 评论 -
LeetCode 108. Convert Sorted Array to Binary Search Tree
题目: Given an array where elements are sorted in ascending order, convert it to a height balanced BST.思路: 将一个已排序的数组构成一个高度平衡的二叉排序树。每次中点为根结点,然后递归调用中点左边剩下的和右边剩下的元素。代码1:输出结果: 12ms代码2: 没有代码1快。/** * Defin原创 2017-05-01 16:45:11 · 350 阅读 · 0 评论 -
LeetCode 695. Max Area of Island
题目: Given a non-empty 2D array grid of 0’s and 1’s, an island is a group of 1’s (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are s...原创 2018-03-20 16:25:32 · 174 阅读 · 0 评论