Top View of Binary Tree | Dataford Interview Questions

Top View of a Binary Tree

Asked in the Logical and Maintainable Code stage. Given a binary tree, print the top view of the binary tree.

Represent each node as [value, left, right], where a missing child is null. The function receives the root representation and returns a list of visible node values from left to right. Use breadth-first traversal so shallower nodes are considered before deeper nodes. If a right child reaches an already occupied horizontal distance, include it after the regular top-view values in discovery order, as required by the grading contract.

Constraints

Each node is represented as [value, left, right] or null
0 <= number of nodes <= 10^4
-10^9 <= value <= 10^9
The input is a valid binary tree representation

Function Signature

def top_view(root):

Your question is Top View of Binary Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Top View of a Binary Tree

Asked in the Logical and Maintainable Code stage. Given a binary tree, print the top view of the binary tree.

Constraints

Each node is represented as [value, left, right] or null
0 <= number of nodes <= 10^4
-10^9 <= value <= 10^9
The input is a valid binary tree representation

Function Signature

def top_view(root):

Your question is Top View of Binary Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.