i would like to know if...
i know how to write the functions for
&Code:void BST::LeftRotate(BSTNode* x) {}
how do i return these void functions to another function so that i can move the item that has just recently searched to the root of the tree, by rotation to make searching more efficient?Code:void BST::RightRotate(BSTNode* y) {}