Flatten Binary Tree to Linked List

Try to solve the Flatten Binary Tree to Linked List problem.

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:

  • −100≤-100 \leq Node.data ≤100\leq 100.
  • The tree contains nodes in the range [1,500][1, 500].

Examples

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy