如何转换binnary search tree至链接列表？

问题描述

如何从binnary搜索树转换为链表，将每个树的数量连续放到链表中？任何想法？

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 ?

推荐答案

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);
 }
}

这篇关于如何转换binnary search tree至链接列表？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！