Patent ID: 9715514
Date: 2017-07-25
CPC Classifications: G06F

Claim:
1. A computer implemented method performed by a processor, the processor configured to process a set of instructions stored in a memory to convert a k-ary (k≧3) tree to an equivalent height balanced binary tree, the k-ary tree comprising at least three levels, the method comprising: storing, in one or more data structures, one or more nodes of the k-ary tree, wherein the one or more nodes of the k-ary tree comprise a root of the k-ary tree; setting the root of the k-ary tree as a root of the height balanced binary tree; initiating a hands remaining queue that lists the root of the height balanced binary tree with free links and a number of free links associated with the root of the height balanced binary tree in level order from left to right; inserting nodes in the height balanced binary tree based on the one or more nodes of the k-ary tree in the level order by: repeating the level order insertion of the nodes of the k-ary tree into the height balanced binary tree until all nodes in the k-ary tree are processed; and indexing a database by use of the nodes inserted into the height balanced binary tree, wherein the indexed database facilitates storage of the nodes of the height balanced binary tree in a first space, the first space lesser than a second space to store the one or more nodes of the k-ary tree.