Here is the simple code for finding the maximum of a BST:
/* Tree Maximum */
Tree* maxTree(struct Tree *node)
{
while(node->right)
node = node -> right;
return node;
}
For Other Tree operations and complete code refer to : click here
/* Tree Maximum */
Tree* maxTree(struct Tree *node)
{
while(node->right)
node = node -> right;
return node;
}
For Other Tree operations and complete code refer to : click here
No comments:
Post a Comment