定义二叉树节点,需要左右节点,和存放元素值。
实现过程如下所示:
package cn.edu.nwu.tree;
/**
* @author jcm
*
*时间 2016年9月15日
*/
public class TreeNode {
int data;
TreeNode leftChild;
TreeNode rightRight;
TreeNode(int data){
this.data = data;
this.leftChild = null;
this.rightRight = null;
}
}
构建二叉树如下所示:
package cn.edu.nwu.tree;
/**
* @author jcm
*
*时间 2016年9月15日
*/
public class CreateBinaryTree {
public static TreeNode createTreeNode(){
TreeNode t1 = new TreeNode(1);
TreeNode t2 = new TreeNode(2);
TreeNode t3 = new TreeNode(3);
TreeNode t4 = new TreeNode(4);
TreeNode t5 = new TreeNode(5);
TreeNode t6 = new TreeNode(6);
t1.leftChild = t2;
t1.rightRight = t3;
t2.leftChild = t4;
t2.rightRight = t5;
t3.rightRight = t6;
return t1;
}
}