Patent ID: 7415463

Claim:
A method for programming a tree data structure, the method comprising: identifying a parent node, the parent node including a first node value for indicating a path through a subtree in the tree data structure from a root node to the parent node, and the parent node including a first base pointer; determining a memory location for adding a child node based on the first base pointer and a next stride value; identifying at the memory location a second node, the second node including a second node value indicating a second path through the subtree from the root node to the second node; determining that the second node value does not match a node value including the first node value and the next stride value indicating that the second node is not a child of the parent node; determining a new base pointer in response said determining that the second node value does not match the node value; updating the parent node with the new base pointer; adding the child node at a memory location based on the new base pointer and the next stride value, the child node including a third node value indicating a path through a subtree in the tree data structure, the third node value including the first node value and the next stride value; and moving all siblings of the child node, if any are present, to memory locations relative to the new base pointer.