LESSON 311 OF 348 · BINARY TREES

Binary Tree Inorder Traversal /homework in Rust

Practice O(n)

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

Example:

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

Output: [1, 3, 2]

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

STEP 1 OF 8

Guided

Ctrl + Enter to check

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

Inorder Traversal in Rust