Exercise: Binary Tree Post-order II

labuladongOriginalAbout 8177 words

Prerequisite Knowledge

Before reading this article, you need to learn:

Basics of Binary Tree Traversal
Binary Tree Techniques (Post-order)
Binary Tree Techniques (General)

Basic binary tree functions like summing up values or finding the height are easy to write. Sometimes, you just need to add a bit of code in their post-order positions to get the desired results.

687. Longest Univalue Path

Thoughts

Solution

Algo Visualizer

865. Smallest Subtree with all the Deepest Nodes

Thoughts

Solution

Algo Visualizer

1026. Maximum Difference Between Node and Ancestor

Thoughts

Solution

Algo Visualizer

1339. Maximum Product of Splitted Binary Tree

Thoughts

Solution

1372. Longest ZigZag Path in a Binary Tree

Thoughts

Solution

Algo Visualizer

606. Construct String from Binary Tree

Thoughts

Solution

Algo Visualizer

1443. Minimum Time to Collect All Apples in a Tree

Thoughts

Solution

Algo Visualizer