C# (CSharp) AlgorithmsAndDataStructuresTests.DataStructures.Trees.Nary BTreeTestsUtils.HasBTreeProperties Examples

Example #1

 public void Delete_BiggestKeyInAFullLeaf_ExpectsToReduceBy1Key()
 {
     Assert.IsTrue(_tree.Delete(270));
     BTreeTestsUtils.HasBTreeProperties(_tree, 15, 15, 15);
 }

Example #2

 public void Delete_ThirdBiggestKeyInTreeLeafNode_ExpectsToReduceBy4NodesAnd1Key()
 {
     Assert.IsTrue(_tree.Delete(400));
     BTreeTestsUtils.HasBTreeProperties(_tree, 15, 15, 11);
 }

Example #3

 public void Delete_SmallestKeyInRightSubtreeLeafNode_ExpectsToReduceBy1Key()
 {
     Assert.IsTrue(_tree.Delete(150));
     BTreeTestsUtils.HasBTreeProperties(_tree, 15, 15, 15);
 }

Example #4

 public void Delete_TheOnlyKeyInParentNodeOfRightMostLeavesOnRightSubtree_ExpectsToReduceBy4NodesAnd1Key()
 {
     Assert.IsTrue(_tree.Delete(500));
     BTreeTestsUtils.HasBTreeProperties(_tree, 15, 15, 11);
 }

Example #5

 public void Delete_TheOnlyKeyOfRightChildOfRoot_ExpectsToReduceBy1Key()
 {
     Assert.IsTrue(_tree.Delete(300));
     BTreeTestsUtils.HasBTreeProperties(_tree, 15, 15, 15);
 }

Example #6

 public void Delete_TheOnlyKeyOfLeftChildOfRoot_ExpectsToReduceBy4NodesAnd1Key()
 {
     Assert.IsTrue(_tree.Delete(50));
     BTreeTestsUtils.HasBTreeProperties(_tree, 15, 15, 11);
 }

Example #7

 public void Delete_Root_ExpectsToReduceBy4NodesAnd1Key()
 {
     Assert.IsTrue(_tree.Delete(100));
     Assert.AreEqual(2, _tree.Root.KeyCount);
     BTreeTestsUtils.HasBTreeProperties(_tree, 15, 15, 11);
 }