Class BTree<T>

Class representing a B-Tree, a balanced tree structure for efficient insertion, deletion, and search operations. Each node can have a variable number of keys and child nodes, based on the minimum degree.

Type Parameters

T
The type of keys stored in the tree.

Index

Constructors

Methods

delete insert print search

Constructors

constructor

new BTree<T>(t, comparator): BTree<T>
Creates an instance of BTree.
Type Parameters
- T
Parameters
- t: number
  Minimum degree (defines the range for the number of keys in nodes).
- comparator: ((a: T, b: T) => number)
  A comparator function for comparing keys.
  - - (a, b): number
    - Parameters
      a: T
      b: T
      Returns number
Returns BTree<T>
- Defined in data-structures/trees/b-tree/BTree.ts:41

Methods

delete

delete(key): void
Deletes a key from the B-Tree, adjusting nodes to maintain the B-Tree properties.
Parameters
- key: T
  The key to delete.
Returns void
- Defined in data-structures/trees/b-tree/BTree.ts:93

insert

insert(key): void
Inserts a key into the B-Tree, balancing nodes as needed.
Parameters
- key: T
  The key to insert.
Returns void
- Defined in data-structures/trees/b-tree/BTree.ts:74

print

print(node?, depth?): string
Prints the B-Tree structure for visualization, showing levels and keys at each node.
Parameters
- node: BTreeNode<T> = ...
  The node to print (default is the root).
- depth: number = 0
  The current level of the node.
Returns string
- The string representation of the tree.
- Defined in data-structures/trees/b-tree/BTree.ts:307

search

search(key, node?): BTreeNode<T>
Searches for a key in the B-Tree, starting from the root or a specified node.
Parameters
- key: T
  The key to search for.
- Optionalnode: BTreeNode<T> = ...
  The node to start the search from.
Returns BTreeNode<T>
- The node containing the key, or null if not found.
- Defined in data-structures/trees/b-tree/BTree.ts:53