Binary Trie
Learn Binary Trie (Trie, Advanced DSA) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.
A Trie Over Bits Instead of Characters A Binary Trie stores integers bit by bit (usually from the MOST significant bit down), instead of characters. Each node has at most TWO children (0 or 1) - a fixed alphabet of size 2, which is what makes it so useful for numeric problems, especially involving XOR.