Check for Identical BSTs without building the trees – Given two arrays which represent a sequence of keys. Imagine we make a Binary Search Tree (BST)
check if two binary search trees are identical given their array representations
1 Article
1