二叉链表(双叉链表)实现二叉树

1.二叉树的节点声明

 1 package com.neusoft.Tree;
 2 /**
 3  * @author zhao-chj
 4  * 保存Node节点的数据域指针域
 5  */
 6 public class BiTreeNode {
 7     public Object data;//数据域
 8     public BiTreeNode lchild,rchild;
 9     public BiTreeNode() {
10         // TODO 构造函数
11         this(null);
12     }
13     public BiTreeNode(Object data){
14         this(data,null,null);
15     }
16     public BiTreeNode(Object data,BiTreeNode lchild,BiTreeNode rchild){
17         this.data=data;
18         this.lchild=lchild;
19         this.rchild=rchild;
20     }
21 }

点击+复制代码

 1 package com.neusoft.Tree;
 2 /**
 3  * @author zhao-chj
 4  * 保存Node节点的数据域指针域
 5  */
 6 public class BiTreeNode {
 7     public Object data;//数据域
 8     public BiTreeNode lchild,rchild;
 9     public BiTreeNode() {
10         // TODO 构造函数
11         this(null);
12     }
13     public BiTreeNode(Object data){
14         this(data,null,null);
15     }
16     public BiTreeNode(Object data,BiTreeNode lchild,BiTreeNode rchild){
17         this.data=data;
18         this.lchild=lchild;
19         this.rchild=rchild;
20     }
21 }

点击+复制代码