I donno if my idea is efficient. I'll do a breath-first traversal and check IsBST on each node(modified to also get the count of nodes) So at each level, the largest BST is kept track of and end of the level, the largest subtree can be returned. If there is no BST at that level go down one level more.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
