用java构建完全二叉树

//树结点类
public class TreeNode {

 private int value;
 private TreeNode leftchild;
 private TreeNode rightchild;
 
 public int getValue() {
  return value;
 }
 public void setValue(int value) {
  this.value = value;
 }
 public TreeNode getLeftchild() {
  return leftchild;
 }
 public void setLeftchild(TreeNode leftchild) {
  this.leftchild = leftchild;
 }
 public TreeNode getRightchild() {
  return rightchild;
 }
 public void setRightchild(TreeNode rightchild) {
  this.rightchild = rightchild;
 }
 }

 

//树类
public class Tree {
 private TreeNode node;

 public TreeNode getNode() {
  return node;
 }

 public void setNode(TreeNode node) {
  this.node = node;
 }
}

//队列

import java.util.LinkedList;


public class Queue {

 private LinkedList<TreeNode> list;
 public LinkedList<TreeNode> getList() {
  return list;
 }
 public void setList(LinkedList<TreeNode> list) {
  this.list = list;
 }
 public Queue(){
  list = new LinkedList<TreeNode&g