The question seems to make it clear we need to check if each route from root to leaf node has any pseudo-palindromic. In my first approach I was only interested in keeping the list of each route Now check if any of this list is pseudo-palindromic. The code below makes it easy without considering the constraints of this question The number of nodes in the tree is in the range [1, 10^5]. Well this..
