Tek-Tips is the largest IT community on the Internet today!
Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!
-
Congratulations bkrike on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!
Recent content by liukevin
-
finding the bst height
ok .... allow me to explain. BST = binary search tree class BST { public: . . int height() private: Node* root; } now i know how to use a class, calling it's function with a object. but writing the code recursivly with no input parameter is the problem i'm having right now. -
finding the bst height
i need some help on this... i need to find the height of a BST with the function prototype int height(); i know how to do it if the prototype is int height (BSTNode *treePtr) const { if (treePtr == NULL) return 0; else { if (findheight (treePtr ->right) > findheight(treePtr ->left))...
