User profile: kaizen

User info
User name:	kaizen
History
Joined:
Number of posts:	7
Latest posts:	Subtree and deepest node [code]template <class T> bool BST<T>::fGS2(T grandFather, BTNode<T> cur) { if (cur == NULL) return... Subtree and deepest node* [code]#ifndef BT_type #define BT_type #include "BTNode.h" #include "Queue.h" #include <fstream> ... Subtree and deepest node I got 2 problem in my bst coding. 1. I knw how to find the deepest node using the height of the tr... BST problem ohh okok, i understand now thank you very much. BST problem Im not using struct but class, i understand the step of your code but dn knw hw to change it and put...

This user does not accept Private Messages