2015年4月9日
[LeetCode] Balanced Binary Tree
摘要： 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 depth... 阅读全文
posted @ 2015-04-09 16:58 穆穆兔兔 阅读(195) 评论(0) 推荐(0)
[Leetcode] Convert Sorted List to Binary Search Tree
摘要： Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Hide TagsDepth-first SearchLinked List方法一... 阅读全文
posted @ 2015-04-09 15:50 穆穆兔兔 阅读(217) 评论(0) 推荐(0)
[LeetCode] Convert Sorted Array to Binary Search Tree
摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST.Hide TagsTreeDepth-first Search方法一：递归，也是dfs/** * Defi... 阅读全文
posted @ 2015-04-09 15:31 穆穆兔兔 阅读(149) 评论(0) 推荐(0)