2016年7月12日
Unique Binary Search Trees II
摘要： Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should 阅读全文
posted @ 2016-07-12 19:57 YuriFLAG 阅读(143) 评论(0) 推荐(0)
Kth Smallest Element in a BST
摘要： Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assume k is always valid, 1 ≤ k ≤ BST's 阅读全文
posted @ 2016-07-12 17:23 YuriFLAG 阅读(149) 评论(0) 推荐(0)