public void InorderTraversalSingleNodeTest() { var tree = new MyBinaryTree(1); BinaryTreeInorderTraversal.InorderTraversal(tree).Should().ContainInOrder(new List <int> { 1 }); }
public void InorderTraversalTestCase2() { var tree = new MyBinaryTree(2); tree.Left = new MyBinaryTree(3); tree.Left.Left = new MyBinaryTree(1); BinaryTreeInorderTraversal.InorderTraversal(tree).Should().ContainInOrder(new List <int> { 1, 3, 2 }); }
public void Test1() { var result = solution.InorderTraversal(new TreeNode(1) { right = new TreeNode(2) { left = new TreeNode(3) } }); Assert.AreEqual(new int[] { 1, 3, 2 }, result); }
public void TestMethod1() { // Arrange BinaryTreeInorderTraversal question = new BinaryTreeInorderTraversal(); TreeNode root = new TreeNode(1); root.right = new TreeNode(2); root.right.left = new TreeNode(3); int[] expected = new int[] { 1, 3, 2 }; // Act IList <int> actual = question.InorderTraversal(root); // Assert CollectionAssert.AreEqual(expected, actual?.ToArray()); }
public void InorderTraversalTestCase1() { var tree = new MyBinaryTree(6); tree.Left = new MyBinaryTree(2); tree.Left.Left = new MyBinaryTree(1); tree.Left.Right = new MyBinaryTree(4); tree.Left.Right.Left = new MyBinaryTree(3); tree.Left.Right.Right = new MyBinaryTree(5); tree.Right = new MyBinaryTree(7); tree.Right.Right = new MyBinaryTree(9); tree.Right.Right.Left = new MyBinaryTree(8); BinaryTreeInorderTraversal.InorderTraversal(tree).Should().ContainInOrder(new List <int> { 1, 2, 3, 4, 5, 6, 7, 8, 9 }); }
public void binaryTreeInorderTraversalTest() { var result = BinaryTreeInorderTraversal.InorderTraversal(root); Console.WriteLine("Inorder Traversal: "); foreach (int i in result) { Console.Write(i + ", "); } Console.WriteLine(); var iterativeInorder = BinaryTreeInorderTraversal.IterativeInorderTraversal(root); Console.WriteLine("Inorder Traversal: "); foreach (int i in iterativeInorder) { Console.Write(i + ", "); } }