java用三叉链表构建二叉树_二叉树的三叉链表存储（java实现）

package com.fcy.dataStruct;

/**

* 与二叉树的二叉链表存储相比，三叉链表存储

* 多了一个指针域来记录当前节点的父节点

*/

class ThreeLinkBinTree{

public static class TreeNode{

Object data;

TreeNode left; //左子节点

TreeNode right; //右子节点

TreeNode parent; //父节点

public TreeNode(){

}

public TreeNode(Object data){

this.data=data;

}

public TreeNode(Object data,TreeNode left,TreeNode right,TreeNode parent){

this.data=data;

this.left=left;

this.right=right;

this.parent=parent;

}

}

private TreeNode root;

public ThreeLinkBinTree(){

this.root=new TreeNode();

}

//以指定根元素来创建二叉树

public ThreeLinkBinTree(E data){

this.root=new TreeNode(data);

}

/**</