Abstract: The present invention is applicable to the field of computer technologies and provides a binary tree storage method and system. The method includes: dividing a binary tree into a root tree and a plurality of subtrees, where the plurality of subtrees is layered and stored in N levels of storages; partitioning the plurality of subtrees into M types according to a preset rule, so that the plurality of subtrees is partitioned into N×M data blocks; and adjusting storage positions of the N×M data blocks in the storages, so that a storage at each level occupies the same number of storage units. In the present invention, storage spaces for nodes at each level, which are spaces of non-uniform sizes, are normalized into spaces of the same size, thereby increasing a space utilization rate of storages.

Abstract: The present invention relates to the field of communication technologies, and discloses a method and an apparatus for forwarding packets to solve the problems in the prior art, namely, if a long Internet Protocol (IP) address needs to be searched for at the time of forwarding a packet, the number of Ternary Content Addressable Memories (TCAMs) need to be increased, or an external Random Access Memory (RAM) needs to be accessed for more times, which leads to a high cost and low performance.

Abstract: The present invention is applicable to the field of computer technologies and provides a binary tree storage method and system. The method includes: dividing a binary tree into a root tree and a plurality of subtrees, where the plurality of subtrees is layered and stored in N levels of storages; partitioning the plurality of subtrees into M types according to a preset rule, so that the plurality of subtrees is partitioned into N×M data blocks; and adjusting storage positions of the N×M data blocks in the storages, so that a storage at each level occupies the same number of storage units. In the present invention, storage spaces for nodes at each level, which are spaces of non-uniform sizes, are normalized into spaces of the same size, thereby increasing a space utilization rate of storages.

Abstract: A tree-based node insertion method and a memory device are disclosed in embodiments of the present invention. The tree-based node insertion method includes: according to the key value of a node to be inserted, searching in a primary tree for the nearest node whose key value is smaller than and the most approximate to the key value of the node to be inserted; judging whether the current secondary tree is full, and if so, selecting a node from the current secondary tree as a split node, transferring all the nodes on the right of the split node in the current secondary tree to the new secondary tree, and if not, inserting the node to be inserted into the current secondary tree.

Abstract: The present invention relates to the field of communication technologies, and discloses a method and an apparatus for forwarding packets to solve the problems in the prior art, namely, if a long Internet Protocol (IP) address needs to be searched for at the time of forwarding a packet, the number of Ternary Content Addressable Memories (TCAMs) need to be increased, or an external Random Access Memory (RAM) needs to be accessed for more times, which leads to a high cost and low performance.

Abstract: A tree-based node insertion method and a memory device are disclosed in embodiments of the present invention. The tree-based node insertion method includes: according to the key value of a node to be inserted, searching in a primary tree for the nearest node whose key value is smaller than and the most approximate to the key value of the node to be inserted; judging whether the current secondary tree is full, and if so, selecting a node from the current secondary tree as a split node, transferring all the nodes on the right of the split node in the current secondary tree to the new secondary tree, and if not, inserting the node to be inserted into the current secondary tree.