Help with Btree homework
- by Phenom
I need to do a preorder traversal of a Btree, and among other things, print the following information for each page (which is the same thing as a node):
The B-Tree page number
The value of each B-Tree page pointer (e.g., address, byte offset, RRN).
My questions are:
1. How do you figure out the byte offset? What is it offset from?
2. Isn't the RRN the same as the page number?
Note: A Btree is NOT A BINARY TREE. Btrees can have multiple keys in each node, and a node with n keys has n+1 child pointers.