0,2,1,4,3

0,1,4,3,2

0,1,2,3,4

0,3,4,1,2

0,1,3,4,2

0, 1, 2, 3, 4

0, 1, 4, 3, 2

0, 1, 3, 4, 2

0, 2, 1, 3, 4

0, 1, 2, 4, 3

Keys are represented as binary numbers.

Leaves in the tree have depth not greater than m if keys are represented by m bits.

Keys are stored only in leaf nodes.

The structure of binary search trie depends on the key insertion order.

For each node the left child stores smaller key and the right child stores greater key than the parent node.

It is a kind of BTree.

If keys are inserted in sorted order then binary search trie degenerates to tree with one branch.

It stores several keys in each node.

The structure of binary search trie is independent of the key insertion order.

Keys are stored in internal and external nodes.

External nodes store all keys and values.

The same key can not be stored in internal node and external node.

Keys may be traversed sequentially faster in B+Tree than in BTree.

The same key can be stored in internal node and external node.

Leaf nodes are linked together.

Internal nodes store only keys.

External nodes store only keys.

Keys may be traversed sequentially faster in BTree than in B+Tree.

Internal nodes store all keys and values.

Height of a Red-Black tree is proportional to the number of nodes.

Color of red node's children can be either red or black.

Use rotations and recoloring to maintain balance.

Worst-case time complexity of O(log n) for search, insertion, and deletion

It's a type of self-balancing binary search tree.

Every leaf node is at the same depth.

The width of Btree increases faster than the height.

Internal nodes store keys and values.

It is binary tree.

The height of Btree increases faster than the width.

Internal nodes store only keys, not values.

Search time is O(N log N).

Each node stores four keys.

Search time is O(log N).

If nodes has k-1 keys then it has k child nodes.

The difference in height between left and right subtrees of any node is at most 1.

This is a type of binary search tree.

The height is log(N).

The height is proportional to the number of nodes in the tree.

Has constant-time insertion and deletion operations.

The difference in height between left and right subtrees of any node is at most 0.

Maintains balance by performing rotations.