목차
없음
본문내용
)
{
grand.left = inNode;
return;
}
}
else
{
position = position.right;
if(position == null)
{
grand.right = inNode;
return;
}
}
}
}
}
public void show()
{
Node i;
for(i=root; i!=null; i=i.right)
{
System.out.print(i.num + " ");
}
}
public void preorder(Node root)
{
if(root!=null)
{
System.out.print("[ " + root.num + " ] ");
preorder(root.left);
preorder(root.right);
}
}
public void preorderShow()
{
preorder(root);
}
public void inorder(Node root)
{
if(root!=null)
{
inorder(root.left);
System.out.print("[ " + root.num + " ] ");
inorder(root.right);
}
}
public void inorderShow()
{
inorder(root);
}
public void postorder(Node root)
{
if(root!=null)
{
postorder(root.left);
postorder(root.right);
System.out.print("[ " + root.num + " ] ");
}
}
public void postorderShow()
{
postorder(root);
}
}
{
grand.left = inNode;
return;
}
}
else
{
position = position.right;
if(position == null)
{
grand.right = inNode;
return;
}
}
}
}
}
public void show()
{
Node i;
for(i=root; i!=null; i=i.right)
{
System.out.print(i.num + " ");
}
}
public void preorder(Node root)
{
if(root!=null)
{
System.out.print("[ " + root.num + " ] ");
preorder(root.left);
preorder(root.right);
}
}
public void preorderShow()
{
preorder(root);
}
public void inorder(Node root)
{
if(root!=null)
{
inorder(root.left);
System.out.print("[ " + root.num + " ] ");
inorder(root.right);
}
}
public void inorderShow()
{
inorder(root);
}
public void postorder(Node root)
{
if(root!=null)
{
postorder(root.left);
postorder(root.right);
System.out.print("[ " + root.num + " ] ");
}
}
public void postorderShow()
{
postorder(root);
}
}
소개글