Class BpTree<T>
A B+ tree implementation.
Assembly: Advanced.Algorithms.dll
Syntax
public class BpTree<T> : IEnumerable<T> where T : IComparable
Type Parameters
Constructors
BpTree(Int32)
Declaration
public BpTree(int maxKeysPerNode = 3)
Parameters
Type |
Name |
Description |
Int32 |
maxKeysPerNode |
|
Properties
Count
Declaration
public int Count { get; }
Property Value
Max
Declaration
Property Value
Min
Declaration
Property Value
Methods
AsEnumerableDesc()
Declaration
public IEnumerable<T> AsEnumerableDesc()
Returns
Type |
Description |
IEnumerable<T> |
|
Delete(T)
Time complexity: O(log(n)).
Declaration
public void Delete(T value)
Parameters
Type |
Name |
Description |
T |
value |
|
GetEnumerator()
Declaration
public IEnumerator<T> GetEnumerator()
Returns
Type |
Description |
IEnumerator<T> |
|
GetEnumeratorDesc()
Declaration
public IEnumerator<T> GetEnumeratorDesc()
Returns
Type |
Description |
IEnumerator<T> |
|
HasItem(T)
Time complexity: O(log(n)).
Declaration
public bool HasItem(T value)
Parameters
Type |
Name |
Description |
T |
value |
|
Returns
Insert(T)
Time complexity: O(log(n)).
Declaration
public void Insert(T newValue)
Parameters
Type |
Name |
Description |
T |
newValue |
|