水中的鱼

Given a binary search tree, write a function  kthSmallest  to find the  k th smallest element in it. Note:  You may assume k is always v...

Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target. Note: Given target va...

Given a binary tree, return the  vertical order  traversal of its nodes' values. (ie, from top to bottom, column by column). If two n...

Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory ...

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the ...

A very frequent interview question. Suppose you have a tree, how could you serialize it to file and revert it back? for example,       ...

Given an array where elements are sorted in ascending order, convert it to a height balanced BST. » Solve this problem [Thoughts] If w...

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

Given a binary tree containing digits from  0-9  only, each root-to-leaf path could represent a number. An example is the root-to-leaf p...

In Binary Tree, Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the l...

Given a binary tree, flatten it to a linked list in-place. For example, Given 1 / \ 2 5 / \ \ 3...