LinkedIn OA Question 2024 June | Trees & BFS | on-campus

Question: Binary Tree Right Side View Problem Statement Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Constraints The number of nodes in the tree is in the range [0, 100]. -100 <= Node.val <= 100 Examples Example 1: Input: root = [1,2,3,null,5,null,4] Output: [1,3,4] Explanation 1: Stand on the right side of the binary tree. The nodes visible ...