5,350
edits
Parallel Algorithms: Difference between revisions
→2-3 tree
| Line 228: | Line 228: | ||
* Each node has 2-3 ordered children | * Each node has 2-3 ordered children | ||
* For any internal node, every directed path to a leaf is the same length | * For any internal node, every directed path to a leaf is the same length | ||
Types of queries: | |||
* ''search(a)'' | |||
* ''insert(a)'' | |||
* ''delete(a)'' | |||
==Resources== | ==Resources== | ||