public void TestBinarySearch() { MaxHeap <int> maxHeap = new MaxHeap <int>(new BinaryTreeNode <int>(100)); maxHeap.Insert(80); maxHeap.Insert(85); maxHeap.Insert(24); maxHeap.Insert(56); maxHeap.Insert(45); maxHeap.Insert(115); maxHeap.Insert(95); if (maxHeap.BinarySearch(85, maxHeap.Root).Parent.Value != 100) { Assert.True(false); } BinarySearchTree <int> searchTree = new BinarySearchTree <int>(new BinaryTreeNode <int>(100)); searchTree.Insert(80); searchTree.Insert(85); searchTree.Insert(24); searchTree.Insert(56); searchTree.Insert(45); searchTree.Insert(115); searchTree.Insert(95); if (searchTree.BinarySearch(56, searchTree.Root).Parent.Value != 24) { Assert.True(false); } if (searchTree.BinarySearch(115, searchTree.Root).Parent.Value != 100) { Assert.True(false); } }