Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5642 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@sanskar94511 | 543 |

@akashverma4 | 335 |

@swastik8750 | 237 |

@nishunishuraj18 | 223 |

@nayan2709 | 211 |

@ajaybhardwaj1999 | 196 |

@surajmamgai | 193 |

@AnshikaPandey | 192 |

@gurshehzadsingh | 188 |

@shardul08 | 185 |

@Rajpra786 | 185 |

Complete Leaderboard |

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 2Output:3 1 2 2 1 3Explanation:DLL would be 3<=>1<=>2

**Example 2:**

Input:10 / \ 20 30 / \ 40 60Output:40 20 60 10 30 30 10 60 20 40Explanation:DLL would be 40<=>20<=>60<=>10<=>30.

**Your Task:**

You don't have to take input. Complete the function **bToDLL() **that takes **root **node of the tree as a parameter and returns the head of DLL . The driver code prints the DLL both ways.

**Expected Time Complexity: **O(N).

**Expected Auxiliary Space: **O(H).

**Note: **H is the height of the tree and this space is used implicitly for recursion stack.

**Constraints:**

1 <= Number of nodes <= 10^{5}

1 <= Data of a node <= 10^{5}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Binary Tree to DLL

...