摘要：
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep... 阅读全文
posted @ 2014-11-20 14:42
li303491
阅读(146)
评论(0)
推荐(0)
摘要：
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =... 阅读全文
posted @ 2014-11-20 13:55
li303491
阅读(144)
评论(0)
推荐(0)
摘要：
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.二分递归转换Hide TagsTreeDepth-first Search/** * Definition... 阅读全文
posted @ 2014-11-20 13:04
li303491
阅读(109)
评论(0)
推荐(0)
摘要：
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 @ 2014-11-20 00:44
li303491
阅读(133)
评论(0)
推荐(0)
浙公网安备 33010602011771号