algorithm - Binary Search Tree Shuffling and Resetting - Stack Overflow

algorithm - Binary Search Tree Shuffling and Resetting - Stack Overflow

One can construct a random binary trees out of a set of values by using the following algorithm:

Input: values

1. randomly select a value as the root node - say r.
2. r->left = recursively build a random binary tree out of values[0..r].
3. r->right = recursively build a random binary tree out of values[r+1..values.length()-1].
4. return r.

Read full article from algorithm - Binary Search Tree Shuffling and Resetting - Stack Overflow