Finding the largest subtree in a BST

Question

Given a binary tree, I want to find out the largest subtree which is a BST in it.

Naive approach:

I have a naive approach in mind where I visit every node of

Answer 1

To solve the above problem:

1. one can do an IN-order traversal of the tree
2. Store it in a array and find the 'largest sorted subset'.