In a b-tree, how many children are there per node? — root: 1 to 2t-1 keys non-root: t-1 to 2t-1 keys t could be up to 100, or more. There are n keys and n+1 children. Leaves are all the same level.
G
1.2KGoogle Interview
This flashcard deck made by jwasham contains knowledge about google interview. For more details, please follow https://github.com/jwasham/google-interview-university