Leetcode Problem 199. Binary Tree Right Side View
Leetcode Solutions
BFS: One Queue + Level Size Measurements
- Initialize an empty list
rightsideto store the visible nodes. - Initialize a queue and add the root node to it.
- While the queue is not empty:
a. Record the number of nodes in the current level (
levelLength). b. Iterate over all nodes in the current level. c. For each node, remove it from the queue. d. If it's the last node in the current level, add its value torightside. e. Add the node's left and right children to the queue if they exist. - Return the list
rightside.
Recursive DFS
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...