Programming Interview: Binary Tree to Doubly Linked List in place
This video lecture is produced by S. Saurabh. He is B.Tech from IIT and MS from USA.
You are given a binary tree , you have to convert it into doubly linked list without using any extra memory, you can just manipulate the node pointers in binary tree.
This channel is an ultimate guide to prepare for job interviews for software engineers, software test engineers, computer scientists, engineering students specially computer science and IT engineers, MCA and BCA students. The content of this channel will help students prepare for C,C++, Java, data structures and algorithms. It also covers courses related to networking and database. This channel can be used by students of NIIT, IGNOU etc too.
To study interview questions on Linked List watch • Programming Interviews: Linked List
To prepare for programming Interview Questions on Binary Trees
• Programming Interviews: Binary Trees
To study programming Interview questions on Stack, Queues, Arrays visit
• Programming Interviews: Queue, Stack and A...
To watch all Programming Interview Questions visit
• Programming Interviews Questions
To learn about Pointers in C visit
• Pointers in C (All you wanted to know)
To learn C programming from IITian S.Saurabh visit
• C Programming Tutorial
tags:
"binary tree to doubly linked list"
"binary search tree doubly linked list"
"binary tree doubly linked list java"
"convert binary tree to doubly linked list "
"convert binary tree to doubly linked list in place"
"program to convert binary tree to doubly linked list"
"program to convert binary tree to sorted doubly linked list"