c#创建一个完全二叉树

public class Node
    {
        public int Date { get; set; }
        public Node Leftnode { get; set; }
        public Node Rightnode { get; set; }
        public Node()
        {
            Date = 0;
            Leftnode = null;
            Rightnode = null;
        }
        public Node(int num)
        {
            Date = num;
            Leftnode = null;
            Rightnode = null;
        }
        public Node(int num, Node left, Node right)
        {
            Date = num;
            Leftnode = left;
            Rightnode = right;
        }
        public void Display()
        {
            Console.WriteLine(Date);
            
        }
    }
     public class CreatTree 
    {
        //public Node i = new Node();
        public Node creattree(int x, int n)
        {
            Node i;
            if (x < n)
            {
                
                i = new Node(x);
              //  Console.WriteLine(x);
                i.Leftnode = creattree(2 * x, n);
                i.Rightnode = creattree(2 * x + 1, n);
            }
            else
            {
                i = null;
            }
            return i;
        }
    }