Binary Tree Right Side View — C# Medium Coding Problem

Binary Tree Right Side Viewmedium

using System;
using System.Collections.Generic;

class TreeNode {
    public int val; public TreeNode left, right;
    public TreeNode(int v, TreeNode l = null, TreeNode r = null) { val = v; left = l; right = r; }
}

class Program {
    static IList<int> RightSideView(TreeNode root) {
        var result = new List<int>();
        if (root == null) return result;
        var queue = new Queue<TreeNode>();
        queue.Enqueue(root);
        while (queue.Count > 0) {
            int size = queue.Count;
            for (int i = 0; i < size; i++) {
                var node = queue.Dequeue();
                if (i == size - 1) result.Add(node.val);
                if (node.left  != null) queue.Enqueue(node.left);
                if (node.right != null) queue.Enqueue(node.right);
            }
        }
        return result;
    }

static void Main() {
        var root = new TreeNode(1, new TreeNode(2, null, new TreeNode(5)), new TreeNode(3, null, new TreeNode(4)));
        Console.WriteLine(string.Join(", ", RightSideView(root)));  // 1, 3, 4
    }
}

💻

Click Run to execute your code

Or Submit to run against all hidden test cases

Binary Tree Right Side View — C# Coding Problem

Problem Description

Examples

Example 1

Example 2

Example 3

Binary Tree Right Side View — C# Coding Problem

Problem Description

Examples

Example 1

Example 2

Example 3