Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
For example:
Given the following binary tree,
Given the following binary tree,
1 <--- 2="" 3="" 4="" 5="" pre="">You should return[1, 3, 4].Solution:
Rnd3
No comments:
Post a Comment