生成树的算法

一、实验目的及要求

根据老师所给的代码，执行所有生成树的算法。输出要求：生成满二叉树，跟踪每一个节点的生成过程，即输出该节点所在的层及在该层的位置，以最左边的节点为0。

二、实验内容及步骤

//circleSqQueue.QueueDemo
class QueueNode <T>
{
   
	T data;
	QueueNode<T> next;
	QueueNode()
	{
   
		this.next = null;
	}
	QueueNode(T data)
	{
   
		this.data = data;
		this.next = null;
	}	
}
public class QueueDemo<T> {
   
	QueueNode<T> head = new QueueNode<T>();
	public void enQueue(T data)
	{
   
		QueueNode<T> tail;
		tail = head;
		//move to the last node of queue
		while (tail.next != null)
			tail = tail.next;
		QueueNode<T> node = new QueueNode<T>(data);
		// insert the new node at the tail of queue
		tail.next = node;		
	}	
	public T deQueue()
	{
   
		QueueNode<T> node;
		node = head.next;
		head.next = node.next;
		return node.data;
	}
	public boolean isEmpty()
	{
   
		if</