Qian xiang xing and Trie

Description In an edge-weighted tree, the xor-length of a path p is defined as the xor sum of the weights of edges on p: {xor}length(p)=\oplus{e \in p}w(e) ⊕ is the xor operator. We say a path the xor-longest path if it has the largest xor-length. Gi...