LESSON 308 OF 348 · BINARY TREES

Post Order Tree Traversal in Scala

Practice O(n)

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

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [3,2,1]

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

STEP 1 OF 14

Guided

Ctrl + Enter to check

Keep going with ScalaAbout 340 step-by-step lessons, from your first line of code to coding interviews. Free to start.