TRAKLA2

1. Each new item will be inserted as a leaf node

2. Search for the correct position

3. Insert the item under an existing leaf node based on the next bit

1. Start from the root node and the most significant bit

2. If the item is in the current node, the search ends

3. If not, continue search based on the current bit

• 0 = go left
• 1 = go right

4. Take the next bit and continue from line 2