Traverse an Org Chart by Level

Q: Traverse an Org Chart by Level

This question evaluates understanding of tree and graph data structures, transforming flat employee-manager relations into a hierarchical org chart, level-order traversal, and reasoning about data integrity issues such as cycles, missing managers, or multiple roots.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given an organization's reporting structure as a flat list of employee-manager relationships. Exactly one employee is the root (the CEO) and has no manager.

Example input schema:

employee_id: int
employee_name: string
manager_id: int | null

Task:

Convert the flat reporting structure into a tree.
Return the org chart from top to bottom, one level at a time.
Each level should be shown in full before moving to the next level.

Example output format:

[[CEO], [VP1, VP2], [Mgr1, Mgr2, Mgr3], ...]

Discuss:

your data structures,
time and space complexity,
and how you would handle invalid input such as cycles, missing managers, or multiple roots.

Traverse an Org Chart by Level

Quick Overview

Comments (0)