Previous: Fixed Size Data Sequence Interface, Up: Fixed Size Data Sequences [Index]

There are available sequences constructed over binary search trees such as AVL and array based trees.

The binary search trees are compressed using a B-tree schema. The BST structure is locally collapsed into B-tree nodes. The data structure may also be viewed as a B-tree based one, with the B-tree nodes organized as self balancing binary search trees.

Data is stored exclusively in the B-tree leaves nodes.

The sequences allow for proper random access with O(logN) time.

Sequences with dynamic, AVL tree organized internal nodes:

• Dynamic BST Internal And Leaf Nodes Sequence: | ||

• Dynamic BST Internal And Array Organized Leaf Nodes Sequence: |

Sequences with static, array based BST organized internal nodes:

• Static BST Internal And Array Organized Leaf Nodes Sequence: | ||

• Static BST Internal And Sparse Array Organized Leaf Nodes Sequence: |