balancedtrees library

Classes

AVLTree<K>
AVL tree class
AVLTreeAlgos
Algorithms needed by the AVL tree
AVLTreeIterator<K>
AVLTreeNode<K>
Node for a AVL tree
BPlusCell<K>
BPlusNode<K>
BPlusNodeAlgos
Algorithms to deal with BPlusNode
BPlusTree<K>
B Plus data structure
BPlusTreeAlgos
BPlusTreeLeafIterator<K>
LeftMostNode<K>
As leftMostChild do not have a parentCell, so this node is required for that. Extends BPlusNode,its special node for leftMostBPlusNode, it has a parentNode ref too
Node<K>
BPlusTree's node, which contains cells [...]
Splited<K>
TreeNodeCutSection<K>

Properties

id ↔ int
read / write

Functions

debugHelper<K>(BPlusNode<K> source, BPlusNode<K> target, K keyWorkedUpon, String operation) → void
getTreeInfoFromIterator<K>(AVLTreeIterator<K> itr) → String
preorderTraversalPrettyTreeView<K>(AVLTree<K> tree, {String prefix = "|----", String postfix = "\n", bool showStats = false}) → String
Pretty print binary tree: DO NOT CHANGE THIS, create one for your own if needed: ex: print(preorderTraversalPrettyTreeView(nodeWithCellDeleted.internalCellTree, prefix:"",postfix:"|", showStats: true ))
printBPlusTree<K>({BPlusTree<K> bptree, String message = "NO_MESSAGE"}) → dynamic
Prints BPLus tree beautifully: DO NOT CHANGE THIS, create one for your own if needed

Enums

Assertively
BalanceStatus
CASE_AFTER_OPERATION
RSB = right sibling [...]
Direction
Has
Is
MERGE_CASE
Node_order
ST Stands for Smaller than and GT stands for greater than
SearchType
SPLIT_CASE
LMC stands for : LEFT_MOST_CHILD

Typedefs

ChangeNodeFunction<K>(BPlusNode<K> startNode, Compare<K> compare) → bool
Compare<K>(K k1, K k2) → int