BSTP : Root's right and left subtrees are BST and value at Root is (greater than largest of left) and (smaller than lowest of right).
if BSTP is true, size of this BST is sum of (size of left subtree) and (size of right subtree) plus 1. Compare this value with global maximum. Do it recursively. See the code here http://pastebin.com/xwXXTEnP -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
