Given a tree with n nodes where each node has a lowercase English character c[i].

A path is palindromic if the characters along the path can be rearranged to form a palindrome. This means at most one character appears an odd number of times. ...