← Questions
Left and right views of a binary tree
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Return the left view of a binary tree (the first node seen at each level from the left) and the right view (the last node at each level). Write it with breadth-first search, then with depth-first search, and dry-run both on an example.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding