Solution: Flatten Binary Tree to Linked List
Explore how to flatten a binary tree into a linked list by performing an in-place depth-first search traversal. Understand how to rearrange nodes following preorder order while maintaining O(1) space complexity. This lesson guides you through both naive and optimized approaches, enabling you to implement an efficient solution.
Statement
Given the root of a binary tree, the task is to flatten the tree into a linked list using the same TreeNode class. The left child pointer of each node in the linked list should always be NULL, and the right child pointer should point to the next node in the linked list. The nodes in the linked list should be in the same order as that of the preorder traversal of the given binary tree.
Constraints:
-
Node.data.