Search:

to delete all the nodes of a binary search tree (using the 'post order traversal") i have used the following coding...
even though it does delete all the nodes of the binary search tree, it gives an...

oophs...i was referring to a 'Binary search tree' indeed. Thank you for the help! And sorry if i have confused anyone.

in my coding i'm not comparing the values b'coz im using part of the 'Inorder' traversing coding. So i thought because of that i'll naturally be getting the Minimum and the maximum values in the way...

hmm...i'm a little confused now with the last coding that was posted to this thread
??
i went through it now. It does work for the findMin(to find the minimum) right??

are the following coding correct for finding the maximum value of a binary tree and to find the minimum value of a bin. tree??????

to find the maximum value:
int Tree::findMax(Node* localroot)
{...

what exactly are the differences in the following??
like to create a array of XX objects is
XX obj[3];

What does it mean by the following?
1. creating an array of XX object pointers
2....

what are the advantages and disadvantages of using quick sort over merge sort and vice versa??