Given a binary tree, check if it is a valid Binary Search Tree (BST) without using extra space (O(1) auxiliary space, which typically implies Morris Traversal if recursion stack is considered extra…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.