Given a binary tree root, imagine yourself standing on the right side of the tree, returning the values of the visible nodes in order from top to bottom.

Given a binary tree root, imagine yourself standing on the right side of the tree, returning the values of the visible nodes in order from top to bottom.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: easy

标签: interviewbit, hashedin, company-specific

目标公司: HashedIn

参考答案摘要

Explanation - From the right side view the direct node we can see is [8, 9, 3, 25]. The other nodes like 12 are hidden behind 3. So it cannot be printed. Solution: For Solving this problem, we can tra...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。