2017年7月19日
[LeetCode] 111. Minimum Depth of Binary Tree Java
摘要： 题目： 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 neare 阅读全文
posted @ 2017-07-19 22:14 荒野第一快递员 阅读(192) 评论(0) 推荐(0)
[LeetCode] 110. Balanced Binary Tree Java
摘要： 题目： Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the 阅读全文
posted @ 2017-07-19 21:54 荒野第一快递员 阅读(198) 评论(0) 推荐(0)
[LeetCode] 108. Convert Sorted Array to Binary Search Tree Java
摘要： 题目：Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 题意及分析：给出一个有序序列，构造一棵平衡二叉查找树。二叉查找树：对于任意一个节点，都有左子节点小 阅读全文
posted @ 2017-07-19 20:28 荒野第一快递员 阅读(172) 评论(0) 推荐(0)