<p>Given an integer array <code>nums</code>, return <em>the maximum result of </em><code>nums[i] XOR nums[j]</code>, where <code>0 &lt;= i &lt;= j &lt; n</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,10,5,25,2,8]
<strong>Output:</strong> 28
<strong>Explanation:</strong> The maximum result is 5 XOR 25 = 28.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [14,70,53,83,49,91,36,80,92,51,66,70]
<strong>Output:</strong> 127
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 10<sup>5</sup></code></li>
	<li><code>0 &lt;= nums[i] &lt;= 2<sup>31</sup> - 1</code></li>
</ul>

class XT:
    def __init__(self, size):
        self.root = [[], []]
        self.size = size

    def isempty(self):
        return (len(self.root[0]) == 0 and len(self.root[1]) == 0)  

    def _insert(self, node, num, pos):
        if pos == -1:
            return
        bit = (num & (1 << pos)) > 0
        if len(node[bit]) == 0:
            node[bit].append([])
            node[bit].append([])
        self._insert(node[bit], num, pos-1)
        

    def insert(self, num):
        self._insert(self.root, num, self.size)

    def _maxxor(self, node, num, pos):
        if pos == -1:
            return 0
        bit = (num & (1 << pos)) > 0

        newnode = node[1-bit]
        val = 1 << pos
        
        if len(newnode) == 0:
            newnode = node[bit]
            val = 0
            
        return val + self._maxxor(newnode, num, pos-1)

    def maxxor(self, num):
        return self._maxxor(self.root, num, self.size)

class Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        xt = XT(32)
        xt.insert(nums[0])
        maxxor = 0
        for num in nums[1:]:
            maxxor = max(maxxor, xt.maxxor(num))
            xt.insert(num)

        return maxxor
326934