a bst is given whose leaf nodes having left as well as right pointers not pointing to NULL. rather all the leaf nodes are forming a circular doubly linked list. u have to calculate height of tree.
-- 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.
