How should I practice Binary Tree Inorder Traversal?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen problems in FastPrep.

Is Binary Tree Inorder Traversal associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen coding practice problem when the problem catalog has that company and stage context.

Binary Tree Inorder Traversal

Bloomberg LP● EasyNEW GRADPHONE SCREEN

Learn

Problem statement

Given the root of a binary tree, return its node values in inorder: left subtree, node, then right subtree.

Function

inorderTraversal(root: TreeNode) → int[]

Examples

Example 1

root = [1,null,2,3]return = [1,3,2]

Visit 1, then the left child 3 of node 2, then node 2.

Example 2

root = []return = []

An empty tree has an empty traversal.

Constraints

The tree has at most 10^5 nodes.
Node values are 32-bit signed integers.