public void Insert() { var tree = new CrackingTheCodingInterview.DataStructures.TreesAndGraphs.BinaryTree <int>(); tree.Insert(9); tree.Insert(4); tree.Insert(10); tree.Insert(6); tree.Insert(7); tree.Insert(20); tree.Insert(14); }
public void Find(int number, bool expected) { var tree = new CrackingTheCodingInterview.DataStructures.TreesAndGraphs.BinaryTree <int>(); tree.Insert(9); tree.Insert(4); tree.Insert(10); tree.Insert(6); tree.Insert(7); tree.Insert(20); tree.Insert(14); var actual = tree.Find(number); Assert.AreEqual(expected, actual); }