You need to find the largest value in each row of a binary tree.

**Example:**

Input:1 / \ 3 2 / \ \ 5 3 9Output:[1, 3, 9]

Skip to content
BFS · Binary Tree · Breadth First Search · leetcode · Queue · Trees# Find Largest Value in Each Tree Row

You need to find the largest value in each row of a binary tree.

**Example:**

Input:1 / \ 3 2 / \ \ 5 3 9Output:[1, 3, 9]