Binary Tree Postorder Traversal - Coddicted

Binary Tree Postorder Traversal

Title: Binary Tree Postorder Traversal Source: leetcode.com

Given a binary tree, return the postorder traversal of its nodes’ values.

For example:
Given binary tree {1,#,2,3},

return [3,2,1].

Note: Recursive solution is trivial, could you do it iteratively?

Python solution (Iterative)

Python solution (Recursive)


Back To Top
Rate this post

Leave a Reply