Developed a scalable Python-based solver for the Kth Smallest Path XOR Sum problem in the doocs/leetcode repository, focusing on efficient computation of path XOR sums within tree structures. The solution introduced dedicated Trie and Solution classes to manage node values, parent-child relationships, and query processing, leveraging advanced data structures and bit manipulation techniques. By implementing a Binary Sum Trie, the approach enabled fast retrieval of the k-th smallest XOR sum, laying a foundation for future extensions involving XOR-sum path analysis. The work emphasized clean code structure and maintainability, utilizing Python and core algorithmic concepts to address complex query requirements.