Problem Statement
Given the root of a binary tree, return the nodes visible when the tree is viewed from the left side.
Only the first node at each level is visible.
Brute Force Intuition
In an interview, you can explain it like this:
Related reading
Right 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...
Morris Pre Order Traversal
Problem Statement Given the root of a binary tree, return its preorder traversal. The...
Maximum Width of Binary Tree
Given the root of a binary tree, return the **## Problem Statement Given the root of a binary tree,...
Binary Tree Interview Problems: 6 Traversal Patterns, 15 Problems
The default tree prep is sorting LeetCode's tree tag by acceptance rate, doing the top 40, and hoping...