Range - XOR: a general doubt

#1

in this question, the data structure we used is referred to as trie, but isn’t that a tree?
I mean what is really the difference between a trie and a tree?

#2

hey @arjunsabu99
A Trie is a kind of tree, known by many names including prefix tree, digital search tree, and retrieval tree (hence the name ‘trie’).
A trie represents a sequence in its structure. It is very different in that it stores sequences of values rather than individual single values. Each level of recursion says ‘what is the value of item I of the input list’. This is different to a binary tree which compares the single searched value to each node
In this Question you can use brute force method .