Suppose that the left subtree as well as the right subtree is a BST. The current node also forms a BST, if the predecessor of current node is less than current node and the successor of current node is greater than current node. Incorporating these two checks require 2*log(n). So the total complexity goes to 2n*log(n).
Please Comment. -- 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.
