Hold on!

Warning: this link might be unsafe, please double check the link before you proceed.

https://helloacm.com/teaching-kids-programming-counting-maximal-value-roots-in-binary-tree-recursive-post-order-traversal-dfs-algorithm/