life is too short for a diary

Binary Tree Right Side View Leetcode

Tags: python queue java

We delve into a popular algorithmic problem from LeetCode: the "Binary Tree Right Side View". This problem is an excellent exercise for understanding tree-based data structures and breadth-first traversal techniques.

Problem Statement

The "Binary Tree Right Side View" problem asks us to find the values of the nodes you can see when you look at a binary tree from the right side. This perspective means we only observe the rightmost node at each level of the tree.


Given a binary tree like this:

   / \
  2   3
   \   \
    5   4

The right side view will be [1, 3, 4].


To solve this problem, we employ a breadth-first search (BFS) approach using a queue. BFS allows us to traverse the tree level by level, ensuring we can access the rightmost element of each level.

Code Walkthrough

Time Complexity

The time complexity of this solution is O(N), where N is the number of nodes in the tree. This is because each node is visited exactly once during the BFS traversal.

comments powered by Disqus