Help with Btree homework
Posted
by Phenom
on Stack Overflow
See other posts from Stack Overflow
or by Phenom
Published on 2010-05-11T03:24:16Z
Indexed on
2010/05/11
3:34 UTC
Read the original article
Hit count: 339
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.
© Stack Overflow or respective owner