Given a binary tree root, return the maximum sum of all keys of any sub-tree which is also a Binary Search Tree (BST). A BST is defined such that for every node, values in its left subtree are…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.