二叉树C#中的层序插入

public class TreeNode
{
    public int Value { get; set; }
    public TreeNode Left { get; set; }
    public TreeNode Right { get; set; }

    public TreeNode(int value)
    {
        Value = value;
        Left = null;
        Right = null;
    }
}

public class BinaryTree
{
    public TreeNode InsertLevelOrder(int[] values)
    {
        TreeNode root = null;
        if (values.Length == 0)
            return root;

        Queue<TreeNode> queue = new Queue<TreeNode>();
        root = new TreeNode(values[0]);
        queue.Enqueue(root);

        int i = 1;
        while (i < values.Length)
        {
            TreeNode current = queue.Dequeue();

            if (i < values.Length)
            {
                current.Left = new TreeNode(values[i]);
                queue.Enqueue(current.Left);
                i++;
            }

            if (i < values.Length)
            {
                current.Right = new TreeNode(values[i]);
                queue.Enqueue(current.Right);
                i++;
            }
        }

        return root;
    }
}