- added 'upper' member to inner node (points to rightmost child node)
- adjusted serialize, deserialize and calculateFreeNodeSpace for added
member
- adjusted split to check if new node is rightmost and set parent's
upper to it
- adjusted internal lookup to return 'upper' node (rightmost child) if
no value greater than or equal to searched for key is found
- btree size calculates wrong size now