You need to find the largest value in each row of a binary tree.
Example:
Input:
1
/ \
3 2
/ \ \
5 3 9
Output: [1, 3, 9]
见程序注释
This repository was archived by the owner on Sep 20, 2023. It is now read-only.
0515.find-largest-value-in-each-tree-row
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||