Solution: Find Nodes at k Distance from the Root
Let’s solve the Find Nodes at k Distance from the Root problem.
We'll cover the following
Statement
Given the root
node of a binary tree and an integer value k
, find all the nodes at a distance of k
from the root
node.
Constraints:
Let n
be the number of nodes in a binary tree.
-
n
-
Node.data
- All
Node.data
are unique
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.