Patent ID: 9075533
Filing Date: 2015-07-07
Classification: G06F

Abstract:
1. A binary tree storage method, comprising: dividing a binary tree into a root tree and a plurality of subtrees, wherein 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, wherein N=2 and M=2; and adjusting storage positions of the N×M data blocks in the N levels of storages so that, at each level, each storage at the level occupies the same number of storage units, wherein the adjusting the storage positions of the N×M data blocks in the N levels of storages comprises: storing an upper part of a first type of subtrees in a second level storage, storing a lower part of the first type of subtrees in a first level storage, storing an upper part of a second type of subtrees in the first level storage, and storing a lower part of the second type of subtrees in the second level storage.