| 发明名称 | Tree data structure | ||
| 摘要 | A method of implementing a tree data structure comprises creating a parent and child relationship between a first node and a second node, in which the first node and second node are at the same hierarchical level of the tree data structure, and maintaining only one incoming pointer for each of the nodes in the tree data structure at all times. A tree data structure in which each node in the tree data structure has a single incoming pointer, and in which the tree data structure comprises a pointer directed to a local overflow node from a node at the same hierarchical level as the local overflow node. | ||
| 申请公布号 | US9626398(B2) | 申请公布日期 | 2017.04.18 |
| 申请号 | US201213477789 | 申请日期 | 2012.05.22 |
| 申请人 | Hewlett Packard Enterprise Development LP | 发明人 | Graefe Goetz;Kuno Harumi;Kimura Hideaki |
| 分类号 | G06F17/30 | 主分类号 | G06F17/30 |
| 代理机构 | Fabian VanCott | 代理人 | Fabian VanCott |
| 主权项 | 1. A method of implementing a tree data structure comprising: with a processor: in the data tree structure comprising a number nodes, creating a parent and child relationship between a first node and a second node, in which the first node and second node are at the same hierarchical level of the tree data structure, the first node being a foster parent node and the second node being a foster child node; andmaintaining only one incoming pointer for each of the nodes in the tree data structure at all times;in which the parent and child relationship created between the first node and the second node does not involve a node in a higher hierarchical level of the tree data structure. | ||
| 地址 | Houston TX US | ||