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)
add all greater values to every node in a given bst
1 Article
1
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)