public class Tree {
int data;
Tree leftBranch;
Tree rightBranch;
static Tree root;
Tree (int d){
data=d;
leftBranch=null;
rightBranch=null;
}
public void PreOrder()
{
PreOrder(root);
}
private void PreOrder(Tree p)
{
if(p!=null)
{
System.out.print(p.data);
p.PreOrder(p.leftBranch);
p.PreOrder(p.rightBranch);
}
}
public void InOrder()
{
InOrder(root);
}
private void InOrder(Tree p)
{
if(p!=null)
{
System.out.print(data);
p.PreOrder(p.leftBranch);
p.PreOrder(p.rightBranch);
}
}
public void PostOrder()
{
PostOrder(root);
}
private void PostOrder(Tree p)
{
if(p!=null)
{
p.PreOrder(p.leftBranch);
p.PreOrder(p.rightBranch);
System.out.print(data);
}
}
void Insert(int d)
{
Tree p=root;
Tree pp=null;
while(p!=null)
{
pp=p;
if(p.data>d) {p=p.leftBranch;}
else if (p.data<d){p=p.rightBranch;}
else {}
}
p=new Tree(d);
if(pp.data>d)
{
pp.leftBranch=p;
}
else if(pp.data<d)
{
pp.rightBranch=p;
}
else
{
}
}
boolean Delete(Tree out,int s)
{
Tree p=root;
Tree pp=null;
while(p!=null&&p.data!=s)
{
pp=p;
if(p.data>s) {p=p.leftBranch;}
else if (p.data<s){p=p.rightBranch;}
else {}
}
if(p.data==s)
{
if(pp.data>s)
{
pp.leftBranch=null;
}
}
else
{
return false;
}
return false;
}
}
