public void DeleteNonExistingNode() { var btree = new BTree <int, int>(Degree); for (int i = 0; i < this.testKeyData.Length; i++) { this.InsertTestData(btree, i); } btree.Delete(99999); TreeValidation.ValidateTree(btree.Root, Degree, this.testKeyData.ToArray()); }
public void DeleteNodes() { var btree = new BTree <int, int>(Degree); for (int i = 0; i < this.testKeyData.Length; i++) { this.InsertTestData(btree, i); } for (int i = 0; i < this.testKeyData.Length; i++) { btree.Delete(this.testKeyData[i]); TreeValidation.ValidateTree(btree.Root, Degree, this.testKeyData.Skip(i + 1).ToArray()); } Assert.AreEqual(1, btree.Height); }
private void InsertTestDataAndValidateTree(BTree <int, int> btree, int testDataIndex) { btree.Insert(testKeyData[testDataIndex], testPointerData[testDataIndex]); TreeValidation.ValidateTree(btree.Root, Degree, testKeyData.Take(testDataIndex + 1).ToArray()); }