public void Should_Check_PreOrder_Traversal() { //arrange var tree = new MyBinarySearchTree <int>(); tree.Insert(38); tree.Insert(5); tree.Insert(45); tree.Insert(1); tree.Insert(9); tree.Insert(47); tree.Insert(8); tree.Insert(15); tree.Insert(46); tree.Insert(13); var preOrderTraversal = new int[] { 38, 5, 1, 9, 8, 15, 13, 45, 47, 46 }; //act var result = tree.PreOrderTraversal().ToArray(); //assert tree.Count.ShouldBeEquivalentTo(10); preOrderTraversal.Length.ShouldBeEquivalentTo(result.Length); for (int i = 0; i < preOrderTraversal.Length; i++) { preOrderTraversal[i].ShouldBeEquivalentTo(result[i]); } }
public void Should_Check_PreOrder_Traversal_Empty() { //arrange var tree = new MyBinarySearchTree <int>(); var preOrderTraversal = new int[] { }; //act var result = tree.PreOrderTraversal().ToArray(); //assert tree.Count.ShouldBeEquivalentTo(0); preOrderTraversal.Length.ShouldBeEquivalentTo(result.Length); }