#树和图 · 小土刀 5.0

2016-01-12

Search Range

给定两个值 k1 和 k2（k1 < k2）和一个二叉查找树的根节点。找到树中所有值在 k1 到 k2 范围内的节点。即打印所有x (k1 <= x <= k2) 其中 x 是二叉查找树的中的节点值。

2016-01-12

设计一个算法，并编写代码来序列化和反序列化二叉树。将树写入一个文件被称为“序列化”，读取文件后重建同样的二叉树被称为“反序列化”。

2016-01-12

给一个排序数组（从小到大），将其转换为一棵高度最小的排序二叉树。

2016-01-12

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

2016-01-12

给定一个有向图，图节点的拓扑排序被定义为：

2016-01-12

Implement a trie with insert, search, and startsWith methods.

2016-01-12

Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.

2016-01-12

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?

2016-01-11

Check if a binary tree is a Binary Search Tree (BST), you may assume there is no element having same value.

2016-01-11

Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequen