/**
* <p>
* 二叉树测试类
* </p>
*
* @author ZLi 2017-8-9
*
*/
public class NodeTest {
public static void main(String[] args) {
int[] array = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
Node node = createNode(array, 0, array.length);
preGet(node);
}
public static void preGet(Node node) {
if (node == null)
return;
preGet(node.leftNode);
System.out.println(node.value);
preGet(node.rightNode);
}
public static Node createNode(int[] array, int index, int length) {
if (index >= length) {
return null;
}
Node node = new Node();
node.setValue(array[index]);
node.setLeftNode(createNode(array, index * 2 + 1, length));
node.setRightNode(createNode(array, index * 2 + 2, length));
return node;
}
}