Binary Tree Inorder Traversal

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Binary Tree Inorder Traversal. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

Given the root of a binary tree, return a list of its node values in inorder traversal order. The input is the root node (or null for an empty tree), and the output is an array of integers visited in the order: left subtree, current node, right subtree.

Constraints

0 <= number of nodes <= 10^4
-10^4 <= Node.val <= 10^4
The tree may be empty
A recursive or iterative DFS solution is acceptable

Function Signature

def inorder_traversal(root):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output