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.. | ||||
Given the root of a binary tree, return a deepest node. For example, in the following tree, return d.
a
/ \
b c
/
d