public void PreOrderDeep() { BinaryTree <int> tree = new BinaryTree <int>(); TreeNode <int> branch1 = new TreeNode <int>(new TreeNode <int>(3), 2, new TreeNode <int>(4)); TreeNode <int> branch2 = new TreeNode <int>(new TreeNode <int>(6), 5, new TreeNode <int>(7)); tree.Root = new TreeNode <int>(branch1, 1, branch2); Assert.Equal(new int[] { 1, 2, 3, 4, 5, 6, 7 }, tree.PreOrder()); }
public void PreOrderEmpty() { BinaryTree <int> tree = new BinaryTree <int>(); Assert.Equal(new int[] { }, tree.PreOrder()); }