Right Side View of Binary Tree in DSA Go - Build from Scratch

Right Side View of Binary Tree

📖 Scenario: You are working with a binary tree that represents a family tree. You want to see the family members visible when looking from the right side.

🎯 Goal: Build a program that finds the right side view of a binary tree. The right side view shows the nodes visible when looking at the tree from the right side.

📋 What You'll Learn

Create a binary tree with the exact nodes and structure given

Create a variable to hold the right side view result

Write a function to find the right side view of the binary tree

Print the right side view as a slice of integers

💡 Why This Matters

🌍 Real World

Right side view of a binary tree helps in visualizing hierarchical data from a specific perspective, useful in UI trees, organizational charts, and decision trees.

💼 Career

Understanding tree traversal and views is important for software engineers working with data structures, algorithms, and system design.

1

Create the Binary Tree

Create a binary tree with the exact structure: root node with value 1, left child with value 2, right child with value 3, left child of node 2 with value 4, and right child of node 3 with value 5. Use the TreeNode struct as defined.

DSA Go

package main

import "fmt"

type TreeNode struct {
    Val   int
    Left  *TreeNode
    Right *TreeNode
}

func main() {
    // Create the binary tree nodes here
    // Your code here
}

Hint

Use the &TreeNode{Val: value} syntax to create nodes and assign them to Left and Right fields.

2

Create a Slice to Store Right Side View

Create a variable called rightView as an empty slice of integers to store the right side view nodes.

DSA Go

package main

import "fmt"

type TreeNode struct {
    Val   int
    Left  *TreeNode
    Right *TreeNode
}

func main() {
    root := &TreeNode{Val: 1}
    root.Left = &TreeNode{Val: 2}
    root.Right = &TreeNode{Val: 3}
    root.Left.Left = &TreeNode{Val: 4}
    root.Right.Right = &TreeNode{Val: 5}

    // Create rightView slice here
    // Your code here
}

Hint

Use rightView := []int{} to create an empty slice of integers.

3

Write Function to Find Right Side View

Write a function called rightSideView that takes a pointer to TreeNode called root and returns a slice of integers. Use a breadth-first search (BFS) approach to collect the rightmost node value at each level into the slice.

DSA Go

package main

import "fmt"

type TreeNode struct {
    Val   int
    Left  *TreeNode
    Right *TreeNode
}

func rightSideView(root *TreeNode) []int {
    // Your code here
}

func main() {
    root := &TreeNode{Val: 1}
    root.Left = &TreeNode{Val: 2}
    root.Right = &TreeNode{Val: 3}
    root.Left.Left = &TreeNode{Val: 4}
    root.Right.Right = &TreeNode{Val: 5}

    rightView := []int{}

    // Call rightSideView and assign to rightView
    // Your code here
}

Hint

Use a queue slice to do BFS. Append the last node's value of each level to the result slice.

4

Print the Right Side View

Print the rightView slice using fmt.Println(rightView) to display the right side view of the binary tree.

DSA Go

package main

import "fmt"

type TreeNode struct {
    Val   int
    Left  *TreeNode
    Right *TreeNode
}

func rightSideView(root *TreeNode) []int {
    if root == nil {
        return []int{}
    }
    var result []int
    queue := []*TreeNode{root}
    for len(queue) > 0 {
        levelSize := len(queue)
        for i := 0; i < levelSize; i++ {
            node := queue[0]
            queue = queue[1:]
            if i == levelSize-1 {
                result = append(result, node.Val)
            }
            if node.Left != nil {
                queue = append(queue, node.Left)
            }
            if node.Right != nil {
                queue = append(queue, node.Right)
            }
        }
    }
    return result
}

func main() {
    root := &TreeNode{Val: 1}
    root.Left = &TreeNode{Val: 2}
    root.Right = &TreeNode{Val: 3}
    root.Left.Left = &TreeNode{Val: 4}
    root.Right.Right = &TreeNode{Val: 5}

    rightView := rightSideView(root)

    // Print the rightView slice
    // Your code here
}

Hint

Use fmt.Println(rightView) to print the slice.