The problem of binary trie tree's XOR or maximum value

The trie tree can generally be used to find the closest to the specified value, and the binary trie tree can also find the value that is farthest from the specified value, that is, an XOR or maximum value, because each node has up to two child nodes.

CSU1216

(1) Question: Given an array, find two numbers in the array so that the difference or value of these two numbers is the largest

(2) point: For each element in the array, the binary trie tree looks for an XOR or maximum value. It should be noted that the CSU this wonderful flower can not call the Assert function, if any, will be directly re.

HRBUST1717

(1) Question: Given an array, find the maximum value of any prefix in this array and any one of the suffixes.

(2) Points: First insert each prefix into the trie tree, and then the maximum value of each suffix or