18 lines (13 loc) · 439 Bytes

Problem 1: Systematic Exploration

Problem Statement

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

Input Format

The root of a binary tree.

Output Format

A list of integers representing the inorder traversal.

Constraints

The number of nodes in the tree is in the range [0, 100].
-100 <= Node.val <= 100

Example

Input: root = [1, null, 2, 3]
Output: [1, 3, 2]