BinaryTreeTests.BinaryTreeTests.Test_Postorder_Traverse C# (CSharp) Method

        public void Test_Postorder_Traverse()
        {
            var tree = new BinaryTree<int> { 90, 50, 150, 20, 75, 95, 175, 5, 25, 66, 80, 92, 111, 166, 200 };
            var data = new StringBuilder();
            tree.Traverse(node => data.Append(node + ", "), "Postorder");

            Assert.AreEqual("5, 25, 20, 66, 80, 75, 50, 92, 111, 95, 166, 200, 175, 150, 90, ", data.ToString());
        }