Largest Bst Subtree
1. You are given a partially written BinaryTree class. 2. You are required to find the root of largest sub-tree which is a BST. Also, find the number of nodes in that sub-tree. 3. Input is managed for you. Note -> Please refer the question video for clarity.
Time complexity must be O(n) Space should not be more than required for recursion (call-stack)
Input is managed for you.
15 50 25 12 n n 37 n n 75 62 n n 87 n n