[C#] 이진 트리 Left Skewed Tree, Recursive Print

Left Skewed Tree

    class App
    {
        public App()
        {
            BinaryTree bt = new BinaryTree();
            Node root = bt.AddChild(bt.Root, 1);
            Node nodeB = bt.AddChild(root, 2);
            Node nodeC = bt.AddChild(nodeB, 3);
            Node nodeD = bt.AddChild(nodeC, 4);
        }
    }

---

Recursive Print

	public void Print(Node root)
        {
            if (root == null) return;

            Console.WriteLine("Print: {0}", root.Data);
            PrintRecursive(root.Left);
        }

        private void PrintRecursive(Node root)
        {
            if (root == null) return;

            Console.WriteLine("Print: {0}", root.Data);
            PrintRecursive(root.Left);
        }