二叉树的实现及先序、中序、后序遍历 - JAVA

TreeNode F = new TreeNode("F", null, J);
TreeNode E = new TreeNode("E", H, I);
TreeNode B = new TreeNode("B", D, E);
TreeNode C = new TreeNode("C", F, G);
TreeNode A = new TreeNode("A", B, C);
return A;
}
/**先序遍历二叉树
* */
public void xianIterator(TreeNode node)
{
this.printNode(node);
if(node.getLeftNode()!=null)
{
this.xianIterator(node.getLeftNode());
}
if(node.getRightNode()!=null)
{
this.xianIterator(node.getRightNode());
}
}

/**
* 中序遍历二叉树*/
public void zhongIterator(TreeNode node)
{
if(node.getLeftNode()!=null)
{
this.zhongIterator(node.getLeftNode());
}
this.printNode(node);
if(node.getRightNode()!=null)
{
this.zhongIterator(node.getRightNode());
}
}

/**后序遍历二叉树*/
public void houIterator(TreeNode node)
{
if(node.getLeftNode()!=null)
{
this.houIterator(node.getLeftNode());
}
if(node.getRightNode()!=null)
{
this.houIterator(node.getRightNode());
}
this.printNode(node);
}

public static void main(String[] args) {
BinaryTree binaryTree = new BinaryTree();
TreeNode node = binaryTree.init();
System.out.println("先序遍历的情况");
binaryTree.xianIterator(node);
System.out.println("\n中序遍历的情况");
binaryTree.zhongIterator(node);
System.out.println("\n后序遍历的情况");
binaryTree.houIterator(node);
}

}

package com.kiritor;

/**
* Java二叉树的实现以及遍历
*
* @author Kiritor
*/
public class BinaryTree {

/**
* 输出结点信息*/
public void printNode(TreeNode node)
{
System.out.print(node.getData()+" ");
}
/**
* 定义结点
* */
class TreeNode {
private T data;
private TreeNode leftNode;
private TreeNode rightNode;

public TreeNode(T data, TreeNode leftNode, TreeNode rightNode) {
this.data = data;
this.leftNode = leftNode;
this.rightNode = rightNode;
}

public T getData() {
return data;
}

public void setData(T data) {
this.data = data;
}

public TreeNode getLeftNode() {
return leftNode;
}

public void setLeftNode(TreeNode leftNode) {
this.leftNode = leftNode;
}

public TreeNode getRightNode() {
return rightNode;
}

public void setRightNode(TreeNode rightNode) {
this.rightNode = rightNode;
}

}

// 初始化二叉树
public TreeNode init() {
TreeNode D = new TreeNode("D", null, null);
TreeNode H = new TreeNode("H", null, null);
TreeNode I = new TreeNode("I", null, null);
TreeNode J = new TreeNode("J", null, null);
TreeNode P = new TreeNode("P", null, null);
TreeNode G = new TreeNode("G", P, null);
TreeNode F = new TreeNode("F", null, J);
TreeNode E = new TreeNode("E", H, I);
TreeNode B = new TreeNode("B", D, E);
TreeNode C = new TreeNode("C", F, G);
TreeNode A = new TreeNode("A", B, C);
return A;
}
/**先序遍历二叉树
* */
public void xianIterator(TreeNode node)
{
this.printNode(node);
if(node.getLeftNode()!=null)
{
this.xianIterator(node.getLeftNode());
}
if(node.getRightNode()!=null)
{
this.xianIterator(node.getRightNode());
}
}

/**
* 中序遍历二叉树*/
public void zhongIterator(TreeNode node)

二叉树的实现及先序、中序、后序遍历 (二)