Longest Path With Different Adjacent Characters

Explore how to identify the longest path in a rooted tree where adjacent nodes have distinct characters. Understand tree representation through parent arrays and apply algorithmic patterns to solve this problem efficiently.