SOURCE FILE: useTree.cpp
#include "BT.h" // binary tree operations
#include <iostream.h>
void Display(treeItemType& AnItem);
int main()
{
binTreeClass T1, T2, L; // empty trees
binTreeClass T3(70); // tree with only a root 70
bool Success;
// build the tree in Figure 10-9
T1.SetRootData(40);
T1.AttachLeft(30, Success);
T1.AttachRight(50, Success);
T2.SetRootData(20);
T2.AttachLeft(10, Success);
T2.AttachRightSubtree(T1, Success);
binTreeClass BT(60, T2, T3); // tree in Fig 10-9
BT.InorderTraverse(Display);
BT.LeftSubtree().InorderTraverse(Display);
BT.DetachLeftSubtree(L, Success);
L.InorderTraverse(Display);
BT.InorderTraverse(Display);
return 0;
} // end main