Flatten Binary Tree To Linked List is an example of tree problems. In this post we will see how we can solve in Javascript.

Problem Description

Given a binary tree, flatten it to a linked list in-place. For example,

Given

     1
    / \
   2   5
  / \   \
 3   4   6

The flattened tree should look like:

1
 \
 2
  \
   3
    \
     4
      \
       5
        \
         6

Implementation: Please check the main.js snippet for the solution.  If you have different approach in mind or have any suggestion for this implementation feel free to share in the comment below. Thanks!