b-plus-tree

B+ Tree

Java implementation of a B+ tree with configurable order, leaf linking and iterative traversal.

Highlights

• Insertion with leaf navigation and node splitting.
• Deletion with underflow handling.
• Redistribution and concatenation between sibling nodes.
• Linked leaf nodes for ordered sequential display.
• Iterative in-order traversal using a custom stack.

Files

• BPlusTree.java: core B+ tree implementation.
• No.java: tree node representation.
• Pilha.java and NoPilha.java: custom stack used by iterative traversal.
• Main.java: test scenarios with different tree orders.