Do the inoreder traversal of the tree ,find for maximum continous
increasing sequence in that.find start and end of the elements in that
sequence in the tree,move upto their common ancestoer which is BST
On Jan 15, 6:32 pm, Decipher ankurseth...@gmail.com wrote:
Find the largest BST in a binary tree ? What's the complexity of your algo
(Amazon Question).
--
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.
