# Documentation

## Binary Tree To DLL

<a><img src= "https://img.shields.io/badge/-Microsoft-blue" height="25">&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Goldman Sachs-red" height="25"></a>&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Amazon-violet" height="25"></a>&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Morgan Stanley-orange" height="25"></a>&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Python-brightgreen"></a>

#### Problem Statement

Given a Binary Tree (BT), convert it to a Doubly Linked List(DLL) In-Place. The left and right pointers in nodes are to be used as previous and next pointers respectively in converted DLL. The order of nodes in DLL must be same as Inorder of the given Binary Tree. The first node of Inorder traversal (leftmost node in BT) must be the head node of the DLL.

    Example 1:

    Input:
          1
        /  \
       3    2
    Output:
    3 1 2 
    2 1 3 






#### Solution

To be added soon ... .. ...


