#面试刷题 · 小土刀 5.0

2016-01-12

Recover Binary Search Tree

Two elements of a binary search tree (BST) are swapped by mistake.

2016-01-12

时间复杂度 O(n)，空间复杂度非递归O(1) 递归O(h)

2016-01-12

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can

2016-01-12

Get all the paths (always starts from the root) in a binary tree, whose sum would be equal to given value.

2016-01-12

Given a directed graph, design an algorithm to find out whether there is a route between two nodes

2016-01-12

Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursi

2016-01-12

给定两个值 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.