MOST FREQUENT SUBTREE SUM | LEETCODE # 508 | PYTHON POSTORDER BFS SOLUTION

In this video we are solving an interview question currently being asked at Apple and Amazon: Most Frequent Subtree Sum (Leetcode # 508).
This is yet another question which can be solved in the familiar post order DFS pattern so the solution should be nothing new to regular viewers of this channel!

[@subee128]

Thanks

[@ajayraghunath2298]

Thanks for the solution. I think the lines 24 to 29 are not really needed

[@HalfCowHalfMan]

Thanks for the vid! Just wondering is this the fastest implementation algorithm or is there another method?