public void RightSideViewTests() { BinaryTreeRightSideView obj = new BinaryTreeRightSideView(); TreeNode node = new TreeNode(3) { left = new TreeNode(9) { }, right = new TreeNode(20) { left = new TreeNode(15) { }, right = new TreeNode(7) { } } }; var x = obj.RightSideView(node);// node = new TreeNode(3) { left = new TreeNode(9) { }, }; x = obj.RightSideView(node);// node = Helpers.GenerateBinaryTree(new int?[] { 1, 2, 3, null, 5, null, 4 }); x = obj.RightSideView(node);//[1, 3, 4] }
public void RightSideView(TreeNode root, List <int> expected) { var sut = new BinaryTreeRightSideView(); var actual1 = sut.RightSideViewByUsingQueue(root); var actual2 = sut.RightSideViewByUsingQueue(root); Assert.AreEqual(expected, actual1); Assert.AreEqual(expected, actual2); }
public void TestMethod2() { var node1 = new TreeNode(1); var node2 = new TreeNode(2); var node3 = new TreeNode(3); var node4 = new TreeNode(4); var node5 = new TreeNode(5); var node6 = new TreeNode(6); node1.Left = node2; node1.Right = node3; node2.Left = node5; node3.Left = node4; node5.Right = node6; var r = BinaryTreeRightSideView.DfsWay(node1); Assert.AreEqual(string.Join("", r), "1346"); }
public void BeforeEach() { BinaryTreeRightSideView = new BinaryTreeRightSideView(); }