int main()
{
int N=0;
cin>>N;
char ins[20];
int a,b;
BSTree tree;
for(int i=0;i<N;i++)
{
cin>>ins;
if(ins[0]=='i')
{
cin>>a;
tree.insertData(a);
//tree.printByInOrderTraversal();
}
if(ins[0]=='d')
{
if(ins[6]=='\0')
{
cin>>a;
tree.deletion(a);
//tree.printByInOrderTraversal();
}
else
{
if(ins[7]=='l')
int main() {
BSTree mytree;
mytree.insertion(12);
mytree.insertion(10);
mytree.insertion(20);
mytree.insertion(9);
mytree.insertion(11);
mytree.insertion(10);
mytree.insertion(12);
mytree.insertion(12);
mytree.getMaxDepth();
mytree.getLCA(9, 20);
mytree.getAncestors(9);
mytree.printOrder();
mytree.deletion(20);
mytree.getMaxDepth();
mytree.getLCA(9, 11);
mytree.getAncestors(9);
mytree.printOrder();
mytree.deletion(12);
mytree.getMaxDepth();
mytree.getLCA(9, 12);
mytree.getAncestors(9);
mytree.printOrder();
mytree.deletion(9);
mytree.getMaxDepth();
mytree.getLCA(10, 11);
mytree.getAncestors(12);
mytree.printOrder();
return 0;
}