二叉树结点

定义二叉树结点类：

/**
 * 链式二叉树结点
 * @author Administrator
 *
 */
public class Node {
	int value;
	Node leftChild;
	Node rightChild;

	public Node(int value) {
		this.value = value;
	}

	public Node(int value, Node leftChild, Node rightChild) {
		super();
		this.value = value;
		this.leftChild = leftChild;
		this.rightChild = rightChild;
	}
}

 二叉树的链式存储结构：左子树的索引，该结点的值，右子树的索引