<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 Node:
    def __init__(self):
        self.one=None
        self.zero=None

class Solution:
    def findMaximumXOR(self, nums: List[int]) -> int:
        root=Node()
        
        for num in nums:
            node=root
            for j in range(31,-1,-1):
                tmp= num& 1<<j
                if tmp:
                    if not node.one:
                        node.one=Node()
                    node=node.one
                else:
                    if not node.zero:
                        node.zero=Node()
                    node=node.zero
                    
        ans=0
        for num in nums:
            node=root
            temp=0
            for j in range(31,-1,-1):
                tmp= num & 1<<j
                if node.one and node.zero:
                    if tmp:
                        node=node.zero
                    else:
                        node=node.one
                    temp+=1<<j
                else:
                    if ( node.one and not tmp) or (node.zero and tmp):
                        temp+= 1<<j
                    node= node.one or node.zero
            ans=max(ans,temp)
            
        return ans
144309