This problem was asked by Microsoft.
Given the root of a binary tree, return an array with its level-order traversal.
Input:
1
/ \
2 3
/ \
4 5
Output: [1, 2, 3, 4, 5]challenge-66
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||