Given the root of a binary tree, determine if it is a valid Binary Search Tree (BST), and sort a linked list containing only 0s, 1s, and 2s in a single pass.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.