such that I have random access to all nodes at particular level of the tree. Like fast access to all nodes on level 3.
w*p
2 楼
Methods for storing binary trees Binary trees can be constructed from programming language primitives in several ways. In a language with records and references, binary trees are typically constructed by having a tree node structure which contains some data and references to its left child and its right child. Sometimes it also contains a reference to its unique parent. If a node has fewer than two children, some of the child pointers may be set to a special null value, or to a special sentinel
【在 y*h 的大作中提到】 : such that I have random access to all nodes at particular level of the : tree. : Like fast access to all nodes on level 3.