java循环树_java遍历树的一些问题

classBinaryNode{publicTdata;publicBinaryNodeleft,right;publicBinaryNode(Tdata,BinaryNodeleft,BinaryNoderight){this.data=data;this.left=left;this.right=right;}...

class BinaryNode

{

public T data;

public BinaryNodeleft,right;

public BinaryNode(T data,BinaryNodeleft,BinaryNoderight)

{

this.data=data;

this.left=left;

this.right=right;

}

public BinaryNode(T data)

{

this(data,null,null);

}

}

public class createTree

{

public static void main(String args[])

{

BinaryNodechild_f,child_d,child_b,child_c,root;

child_d=new BinaryNode("D",null,new BinaryNode("G"));

child_b=new BinaryNode("B",child_d,null);

child_f=new BinaryNode("F",new BinaryNode("H"),null);

child_c=new BinaryNode("C",new BinaryNode("E"),child_f);

root=new BinaryNode("A",child_b,child_c);

System.out.println("先序遍历二叉树: ");

preOrder(root);

System.out.println();

System.out.println("中序遍历二叉树: ");

inOrder(root);

System.out.println();

System.out.println("后序遍历二叉树: ");

postOrder(root);

System.out.println();

}

public static void preOrder(BinaryNodep)

{

if(p!=null)

{

System.out.print(p.data.toString());

preOrder(p.left);

preOrder(p.right);

}

}

public static void inOrder(BinaryNodep)

{

if(p!=null)

{

inOrder(p.left);

System.out.print(p.data.toString());

inOrder(p.right);

}

}

public static void postOrder(BinaryNodep)

{

if(p!=null)

{

postOrder(p.left);

postOrder(p.right);

System.out.print(p.data.toString());

}

}

}

这段代码里第一段的代码什么意思

public T data;

public BinaryNodeleft,right;

这些定义什么意思

展开