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.