InterviewDigestTechnical2026-08-16
converting binary tree to linked list
AI-Expanded — inferred from the question title, not from the original candidate report
Given a binary tree, flatten it into a singly linked list in-place such that the linked list follows the same pre-order traversal as the original tree. The right child of every node in the flattened tree should point to the next node in the pre-order sequence, while all left children must be set to null.
Context & Summary
Interview Round 1 with questions on DSA, OS, and DBMS
💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.
Loading editor...
AI can automatically infer and generate example test cases for this question based on standard algorithmic constraints.