public void BinarySearchTree_Insert() { const string expected = "3 10 15 24 30 42 50 60 73 80 83 87 100"; var result = traverser.InOrder(root); Assert.AreEqual(expected, result); }
public void TreeTraverser_InOrder() { const string expected = "4 2 5 1 6 3 7"; var result = traverser.InOrder(root); Assert.AreEqual(expected, result); }
public void traversing_simple_tree_in_order() { ArrayList expected = new ArrayList(); expected.Add(2); expected.Add(1); expected.Add(3); ArrayList array = BinaryTreeTraverser <int> .InOrder(root); Assert.AreEqual(expected, array); }
public void traversing_multi_level_tree_in_order() { root.LeftNode.LeftNode = new BinaryTreeNode <int>(4); root.LeftNode.RightNode = new BinaryTreeNode <int>(5); root.RightNode.LeftNode = new BinaryTreeNode <int>(6); root.RightNode.RightNode = new BinaryTreeNode <int>(7); ArrayList expected = new ArrayList(); expected.Add(4); expected.Add(2); expected.Add(5); expected.Add(1); expected.Add(6); expected.Add(3); expected.Add(7); ArrayList array = BinaryTreeTraverser <int> .InOrder(root); Assert.AreEqual(expected, array); }