2014年6月20日
[LeetCode] Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values.For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2]... Read More
posted @ 2014-06-20 11:18 Xylophone Views(129) Comments(0) Diggs(0)
[LeetCode] Unique Binary Search Trees
Given n, how many structurally unique BST's (binary search trees) that store values 1...n?For example, Given n = 3, there are a total of 5 unique BST'... Read More
posted @ 2014-06-20 10:33 Xylophone Views(163) Comments(0) Diggs(0)