19
In a B+ tree of order n, each internal node (except the root) has at least:
Medium
Back to Indexing and Hashing
Discussion (0)
- No discussion yet. Ask a doubt or share a shortcut.
Log in to join the discussion.