數(shù)據(jù)結(jié)構(gòu)—二叉線索樹

原理：參考趣學(xué)數(shù)據(jù)結(jié)構(gòu)

代碼：

#include<stdio.h> #include<stdlib.h> typedef struct bmTree {int data;struct bmTree* lchild, *rchild;int ltag, rtag; }bmTree; bmTree * pre=NULL;//中序遍歷的前驅(qū)指針 void createBTree(bmTree* & BMTree) {//創(chuàng)建二叉樹int data;scanf_s("%d", &data);if (data == -1) {BMTree = NULL;}else {BMTree= (bmTree*)malloc(sizeof(bmTree));BMTree->data = data;createBTree(BMTree->lchild);createBTree(BMTree->rchild);}} void midTraverseBMTree(bmTree* & BMTree) {//中序構(gòu)造二叉線索樹bmTree* T = BMTree;if (T) {midTraverseBMTree(T->lchild);if (!T->lchild) {T->ltag = 1;//指向直接前驅(qū)T->lchild = pre;}else {T->ltag = 0;//有左孩子}if (pre) {if (!pre->rchild) {pre->rtag = 1;//直接后繼pre->rchild = T;}else {pre->rtag = 0;//有右孩子}}pre = T;midTraverseBMTree(T->rchild);} } void printMideBMT(bmTree * T) {//遍歷二叉線索樹bmTree *p = T;while (p) {while (p->ltag==0) {p = p->lchild;}printf("%d ", p->data);//左結(jié)點(diǎn)while (p->rtag == 1&&p->rchild) {p = p->rchild;printf("%d ", p->data);//根|右結(jié)點(diǎn)}p = p->rchild;//右子樹} } int main() {bmTree* T;createBTree(T);midTraverseBMTree(T);pre->rchild = NULL;//中序遍歷的最后一個(gè)元素，沒有后繼pre->rtag = 1;printf("二叉線索樹進(jìn)行中序遍歷:");printMideBMT(T);printf("\n");system("pause");return 0; }

測(cè)試截圖：

時(shí)間復(fù)雜度O(nlogn),空間復(fù)雜度O(1)

如果存在什么問題，歡迎批評(píng)指正！謝謝！

創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎(jiǎng)勵(lì)來咯，堅(jiān)持創(chuàng)作打卡瓜分現(xiàn)金大獎(jiǎng)

總結(jié)

以上是生活随笔為你收集整理的数据结构---二叉线索树的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。