Good morning! Here's your coding interview problem for today.
This problem was asked by Google.
Given the root of a binary tree, return a deepest node. For example, in the following tree, return d.
a
/
b c
/
d
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
Good morning! Here's your coding interview problem for today.
This problem was asked by Google.
Given the root of a binary tree, return a deepest node. For example, in the following tree, return d.
a
/
b c
/
d