NeetCode #425LC-199MediumTreesNC 150NC 250
← Back to All Problems#425 · #199 · Binary Tree Right Side View(二叉树的右视图)
📌 Problem Statement & Constraints
Given the root of a binary tree, imagine standing on the right side of it and return the values of the nodes visible from top to bottom. Constraints: the number of nodes is in
[0, 100].🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!