Problem Statement
Given the root of a binary tree, return the nodes visible when the tree is viewed from the right side.
Only the last node at each level is visible.
Brute Force Intuition
In an interview, you can explain it like this:
Related reading
Left View of a Binary Tree
leetcode.com Problem...
Top View of Binary Tree | Level Order Traversal
Problem Statement Given the root of a binary tree, return the nodes visible when the tree...
Binary Tree PreOrder Traversal
leetcode.com Problem...
Maximum Width of Binary Tree
Given the root of a binary tree, return the **## Problem Statement Given the root of a binary tree,...
Morris Pre Order Traversal
Problem Statement Given the root of a binary tree, return its preorder traversal. The...
Binary Tree Recursion in Interviews: The Call Stack Diagnostic
I've watched plenty of engineers explain binary tree traversals on a whiteboard and then freeze five...