public void HeapTree_Deserialize_SmallTest() { var tree = new HeapTree(); var list = new List <int>() { 2, 3, 1 }; var result = tree.CreateTree(list).Result; Assert.AreEqual(3, result.Data); Assert.AreEqual(2, result.LeftNode.Data); Assert.AreEqual(1, result.RightNode.Data); }
public void HeapTree_Search() { var heapTree = new HeapTree(); var list = new List <int>() { 2, 4, 6 }; var tree = heapTree.CreateTree(list).Result; var item = heapTree.Search(tree, 2).Result; Assert.AreEqual(2, item.Data); }
public void HeapTree_Deserialize() { var tree = new HeapTree(); var list = new List <int>() { 3, 6, 2, 4, 5, 1 }; var result = tree.CreateTree(list).Result; Assert.AreEqual(6, result.Data); Assert.AreEqual(5, result.LeftNode.Data); Assert.AreEqual(4, result.LeftNode.LeftNode.Data); Assert.AreEqual(3, result.LeftNode.RightNode.Data); Assert.AreEqual(2, result.RightNode.Data); Assert.AreEqual(1, result.RightNode.LeftNode.Data); }
public void HeapTree_Insert_AtMiddle() { var heapTree = new HeapTree(); var list = new List <int>() { 2, 4, 6 }; var tree = heapTree.CreateTree(list).Result; Assert.AreEqual(6, tree.Data); Assert.AreEqual(4, tree.LeftNode.Data); Assert.AreEqual(2, tree.RightNode.Data); tree = heapTree.Insert(tree, 5).Result; Assert.AreEqual(6, tree.Data); Assert.AreEqual(5, tree.LeftNode.Data); Assert.AreEqual(4, tree.LeftNode.LeftNode.Data); Assert.AreEqual(2, tree.RightNode.Data); }