Data tree with order-based node traversal

  • US 10,936,661 B2
  • Filed: 12/26/2018
  • Issued: 03/02/2021
  • Est. Priority Date: 12/26/2018
  • Status: Active Grant
First Claim
Patent Images

1. A system comprising:

  • volatile memory storing a binary tree data structure; and

    a processing device, operatively coupled to the volatile memory, configured to perform operations comprising;

    receiving a key-value pair comprising a particular key and a particular value;

    in response to receiving the key-value pair;

    generating a new node associated with the particular key, the new node comprising a first pointer to point to a first child node of the new node, a second pointer to point to a second child node of the new node, a previous pointer to point to a previous node, and a next pointer to point to a next node, wherein based on a key order, the particular key is adjacent to both a first key associated with the previous node and a second key associated with the next node; and

    inserting the new node into the binary tree data structure to generate an updated binary tree data structure;

    receiving a request to traverse from the new node of the updated binary tree data structure to a subsequent node of the updated binary tree data structure based on the key order; and

    based on the request to traverse, traversing to the subsequent node of the updated binary tree data structure by at least one of the previous pointer of the new node or the next pointer of the new node.

View all claims
    ×
    ×

    Thank you for your feedback

    ×
    ×