int main()
{
Binary_tree<char> dd;
dd.insert('e');
dd.insert('b');
dd.insert('f');
dd.insert('a');
dd.insert('d');
dd.insertNull();
dd.insert('g');
dd.insertNull();
dd.insertNull();
dd.insert('c');
/*Binary_tree<int> ww;
ww = dd;
ww.insert(10);
ww.insert(7);
cout<<"preorder:";
dd.preorder(print);
cout << endl;
dd.inorder(print);
cout << endl;
dd.postorder(print);
cout<<endl;
cout<<"preorder:";
ww.preorder(print);
cout<<endl;
dd.reverse();
cout<<"preorder:";
dd.preorder(print);
cout<<endl;
system("pause");*/
dd.preorder(print);
cout << endl;
dd.inorder(print);
cout << endl;
dd.postorder(print);
cout << endl;
return 0;
}
int main() {
Binary_tree ab;
ab.insert(10);
ab.insert(1);
ab.insert(6);
ab.insert(20);
ab.inorder(ab.getRoot());
cout<< endl;
ab.postorder(ab.getRoot());
cout<< endl;
ab.preorder(ab.getRoot());
int a=ab.size(ab.getRoot());
ab.balancear(ab.getRoot());
cout << a;
return 0;
}
