**Problem link:** http://www.geeksforgeeks.org/check-for-identical-bsts-without-building-the-trees/

**Problem Statement:**

Given two arrays which represent a sequence of keys. Imagine we make a Binary Search Tree (BST) from each array. We need to tell whether two BSTs will be identical or not without actually constructing the tree.

For example, the input arrays are {2, 4, 3, 1} and {2, 1, 4, 3} will construct the same tree

Continue reading

## Recent Comments