public void Test2() { var res = new BinaryTreeZigzagLevelOrderTraversal().ZigzagLevelOrder( new TreeNode(1)); Assert.AreEqual(res.Count, 1); }
public void Test1() { var res = new BinaryTreeZigzagLevelOrderTraversal().ZigzagLevelOrder( new TreeNode(3, new TreeNode(9), new TreeNode(20, new TreeNode(15), new TreeNode(7)))); Assert.AreEqual(res.Count, 3); Assert.AreEqual(res[0][0], 3); }
public void Test1() { var sol = new BinaryTreeZigzagLevelOrderTraversal(); var root = new TreeNode(3) { left = new TreeNode(9) { left = new TreeNode(4) { left = new TreeNode(8), right = new TreeNode(9) }, right = new TreeNode(5) { left = new TreeNode(7), right = new TreeNode( 12) } }, right = new TreeNode(20) { left = new TreeNode(15) { left = new TreeNode(45), right = new TreeNode( 23) }, right = new TreeNode(7) { left = new TreeNode( 48), right = new TreeNode(50) } } }; var ret = sol.ZigzagLevelOrder(root); IList <IList <int> > expected = new List <IList <int> >(); expected.Add(new List <int>() { 3 }); expected.Add(new List <int>() { 20, 9 }); expected.Add(new List <int>() { 4, 5, 15, 7 }); expected.Add(new List <int>() { 50, 48, 23, 45, 12, 7, 9, 8 }); Utlilitiy.AssertAreEqual(expected, ret); }
public void Setup() { solution = new BinaryTreeZigzagLevelOrderTraversal(); }
public void Test3() { var res = new BinaryTreeZigzagLevelOrderTraversal().ZigzagLevelOrder(null); Assert.AreEqual(res.Count, 0); }