How to convert from binnary search tree to linked list ?

Question

1.00/5 (1 vote)

See more:

how to convert from binnary search tree to linked list, each number of tree to put in a row to a linked list ? any Idea ?

Posted 13-May-14 10:16am

Getoar

Add a Solution

Comments

CHill60 13-May-14 16:22pm

That rather depends on how you have implemented your binary search tree. Post your code

Getoar 13-May-14 17:03pm

for more details look at this picture http://d2o58evtke57tz.cloudfront.net/wp-content/uploads/LinkedListToBST.png

Matt T Heffron 13-May-14 18:13pm

This is a breadth-first traversal of the binary tree.
http://en.wikipedia.org/wiki/Tree_traversal#Breadth-first_2

Nelek 13-May-14 18:20pm

If you get asked for it and you do it, you should post your code into the question using the widget "improve question" and then the needed code language. It will increase the readability and the easier people can read your code, the more probability for you to get help

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Vedat Ozan Oner · Answer 1 · 2014-05-13T12:22:00

Matt is right. assuming that you have Tree, LinkedList and Queue structures, you can do something like this:

C#

Tree* tree;
LinkedList* list;

Queue* helper;

void convert() {
 Tree* t; // tmp pointer for current tree node
 helper->enqueue(tree);

 // while helper queue has an item
 while(helper->count>0) {
  // get a node from helper queue
  t=helper->dequeue();
  // add it to list
  list->add(t->node);
  // enqueue left branch
  if(t->left!=NULL)
   helper->enqueue(t->left);
  // enqueue right branch
  if(t->right!=NULL)
   helper->enqueue(t->right);
 }
}