A binary trie stores bit strings by following one edge for each bit, with child edges labeled zero and one. A chosen direction of traversal fixes whether low or high bits are read first.

Ancestors (3)

  1. Data structure
  2. Computer science
  3. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Trie by Ciro Santilli 40 Created 2025-05-29 Updated 2025-07-16
View more
Sample implementations:
Read the full article
See all articles in the same topic Create my own version