Great work! First I thought about BFS (I just know its meaning without knowing its implementation) that we'll search in every level( Breadth ) and find max then print that/ store. I learned an approach from this DFS solution as I was having a problem in comparing elements of the same level but of different parents. Thank you.