1.以下是二叉树遍历的算法:
/**
* @author hbliu
*/
public void PostOrder(){
System.out.println("后序遍历如下:");
PostOrder(this.root);
}
/**
* @author hbliu
* @param node
* 功 能:二叉树后序遍历输出
*/
private void PostOrder(Node node){
if (node == null){
return ;
}
PostOrder(node.leftNode);
PostOrder(node.rightNode);
System.out.print(node.data + " ");
}
/**
* @author hbliu
*/
public void PreOrder(){
System.out.println("先序遍历如下:");
PreOrder(this.root);
}
/**
* @@author hbliu
* @param node
* 功 能:二叉树前序遍历输出
*/
private void PreOrder(Node node){
if (node == null){
return ;
}
System.out.print(node.data + " ");
PreOrder(node.leftNode);
PreOrder(node.rightNode);
}
/**
* @author hbliu
*/
public void InOrder(){
System.out.println("中序遍历如下:");
InOrder(this.root);
}
/**
* @author hbliu
* @param node
* 功 能:二叉树中序遍历输出
*/
private void InOrder(Node node){
if (node == null){
return ;
}
InOrder(node.leftNode);
System.out.print(node.data + " ");
InOrder(node.rightNode);
}