将二叉树转换为线程二叉树| 在C ++中设置1(使用队列)
在本教程中,我们将讨论一个使用队列数据结构将二进制树转换为线程二进制树的程序。
为此,我们将提供一个二叉树。我们的任务是通过添加额外的路由以借助队列数据结构更快地进行有序遍历,从而将该特定的二叉树转换为线程二叉树。
示例
#include <iostream> #include <queue> using namespace std; //线程树的节点结构 struct Node { int key; Node *left, *right; bool isThreaded; }; //将顺序模式放入队列 void convert_queue(Node* root, std::queue<Node*>* q){ if (root == NULL) return; if (root->left) convert_queue(root->left, q); q->push(root); if (root->right) convert_queue(root->right, q); } //遍历队列并创建线程树 void create_threadedtree(Node* root, std::queue<Node*>* q){ if (root == NULL) return; if (root->left) create_threadedtree(root->left, q); q->pop(); if (root->right) create_threadedtree(root->right, q); //如果在NUll中是正确的指针,则将其指向 //顺序后继 else { root->right = q->front(); root->isThreaded = true; } } //最终拿到树并将其转换为线程 void createThreaded(Node* root){ std::queue<Node*> q; convert_queue(root, &q); create_threadedtree(root, &q); } Node* leftMost(Node* root){ while (root != NULL && root->left != NULL) root = root->left; return root; } //执行线程树的有序遍历 void inOrder(Node* root){ if (root == NULL) return; Node* cur = leftMost(root); while (cur != NULL) { cout << cur->key << " "; //if threaded node, move to 顺序后继 if (cur->isThreaded) cur = cur->right; else cur = leftMost(cur->right); } } Node* newNode(int key){ Node* temp = new Node; temp->left = temp->right = NULL; temp->key = key; return temp; } int main(){ Node* root = newNode(1); root->left = newNode(2); root->right = newNode(3); root->left->left = newNode(4); root->left->right = newNode(5); root->right->left = newNode(6); root->right->right = newNode(7); createThreaded(root); cout << "Traversing threaded tree :\n"; inOrder(root); return 0; }
输出结果
Traversing threaded tree : 4 2 5 1 6 3 7