摘要：
Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. 阅读全文
posted @ 2013-01-29 09:55
cradle
阅读(1903)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). 阅读全文
posted @ 2013-01-29 09:19
cradle
阅读(233)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). 阅读全文
posted @ 2013-01-29 09:07
cradle
阅读(223)
评论(0)
推荐(0)
摘要：
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 阅读全文
posted @ 2013-01-29 08:02
cradle
阅读(463)
评论(0)
推荐(0)
浙公网安备 33010602011771号