[1]Member.Use the HASH form to achieve the compression of the tree storage[J].Journal of Zhengzhou University (Engineering Science),1995,16(01):84-87.
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN
1671-6833/CN
41-1339/T] Volume:
16卷
Number of periods:
1995 01
Page number:
84-87
Column:
Public date:
1995-01-28
- Title:
-
Use the HASH form to achieve the compression of the tree storage
- Author(s):
-
Member
-
The Department of Civil Construction Engineering, Zhengzhou Institute of Technology
-
- Keywords:
-
Compression hybrid; hybrid tree; tree structure
- CLC:
-
-
- DOI:
-
-
- Abstract:
-
This article discusses how to use the miscellaneous table in a very compressed form to realize the storage of trees. Using this method, the pointers in any tree can be represented by each node 6 + LOG2N Bit (here n is the largest number of children can have a node). So as to store large trees, the required storage capacity can be significantly reduced.