NeetCode #404LC-545MediumTreesNC Algo100
← Back to All Problems#404 · #545 · Boundary of Binary Tree(二叉树的边界)
📌 Problem Statement & Constraints
Given the root of a binary tree, return its boundary traversal: the root, then the left boundary (excluding leaves) top-down, then all leaves left-to-right, then the right boundary (excluding leaves) bottom-up. Constraints: the number of nodes is in
[1, 10^4].🔒
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!