Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

3
  • $\begingroup$ for leaf node order is the maximum number of <key,pr> pairs it can hold. Then the number of keys should be same as the order of B+ Tree. But according to en.wikipedia.org/wiki/B%2B_tree the max number of keys is n-1 $\endgroup$ Commented Dec 20, 2017 at 10:45
  • $\begingroup$ Why would the maximal number of items/pairs be different for leaf nodes? In both cases it is $n-1$ where $n$ is the order. $\endgroup$ Commented Dec 20, 2017 at 14:46
  • $\begingroup$ @HendrikJan the maximal number of items/pairs can be different for leaf nodes. In leaf we use a record pointer (all bits for an address must be used) whereas in an intermediate node we use block pointers. So less bits required. $\endgroup$ Commented Dec 21, 2017 at 9:19