矩阵转置_十字链表

Acaini.yao — Wed, 13 May 2009 09:06:00 GMT

摘要: �~�写��十字链表表�C�的矩阵A(ch��)转置的程序算法，转置�l�果为另一个十字链表，�q�将该�{�|�矩阵以三元�l?i�Q�j�Q�value)的�Ş式输出�? 1#include 2using namespace std; 3#define MAX 100 4 ... 阅读全文

Acaini.yao 2009-05-13 17:06 发表评论

Acaini.yao — Wed, 13 May 2009 09:00:00 GMT

输入二叉�?span style="COLOR: red">先序�Q�徏�?w��i)，然�?span style="COLOR: red">中序�U�烦(ch��)�?/span>�Q�遍历输�?br>

  1#include<iostream>
  2using namespace std;
  3
  4enum PointerTag
  5{
  6    Link,Thread        //枚�D值Link和Thread分别�?�Q?
  7};
  8
  9struct BiThrNode    //�U�烦(ch��)二叉�?w��i)的�l�点�c�d��
10{
11    char data;
12    PointerTag LTag;    //左标�?/span>
13    PointerTag RTag;    //��x��?/span>
14    BiThrNode *lchild;    //左孩子指�?/span>
15    BiThrNode *rchild;    //叛_��子指�?/span>
16};
17
18typedef BiThrNode* BiThrTree;
19BiThrNode *pre=NULL; //全局�?/span>
20
21void InOrderThreading(BiThrTree & Thrt,BiThrTree T);//�U�烦(ch��)�?/span>
22void InThreading(BiThrTree p);//中序遍历�U�烦(ch��)�?/span>
23bool PreOrderCreatBiTree(BiThrTree &T);//先序建立�?/span>
24void InOrderTraverse_Thr(BiThrTree T);//中序遍历�U�烦(ch��)�?/span>
25
26int main()
27{
28    BiThrTree T,Thrt;
29    printf("输入先序序列('#'表示�I��?建立二叉�?w��i)�?x��)\n");
30    PreOrderCreatBiTree(T);//先序建立�?/span>
31    InOrderThreading(Thrt,T);//中序�U�烦(ch��)�?/span>
32    printf("中序�U�烦(ch��)化，中序遍历得中�~�式：(x��)\n");
33    InOrderTraverse_Thr(Thrt);//中序遍历�U�烦(ch��)�?/span>
34    printf("\n");
35    return 0;
36}
37
38void InOrderThreading(BiThrTree & Thrt,BiThrTree T)
39{
40    Thrt=new BiThrNode;
41    Thrt->LTag=Link;
42    Thrt->RTag=Thread;
43    Thrt->rchild=Thrt;
44    if(!T) Thrt->lchild=Thrt;
45    else{
46        Thrt->lchild=T;
47        pre=Thrt;
48        InThreading(T);
49        pre->rchild=Thrt;
50        pre->RTag=Thread;
51        Thrt->rchild=pre;
52    }
53}
54
55void InThreading(BiThrTree p)
56{
57    if(p)
58    {
59        InThreading(p->lchild);
60        if(!p->lchild){ p->LTag=Thread; p->lchild=pre;}
61        if(!pre->rchild){ pre->RTag=Thread; pre->rchild=p; }
62        pre=p;
63        InThreading(p->rchild);
64    }
65}
66
67bool PreOrderCreatBiTree(BiThrTree &T)
68{//该节炚w��I��回true�Q�双亲节点对应标志Link�Q�空时返回false�Q�双亲节点对应标志应为Thread
69    char ch;
70    scanf("%c",&ch);
71    if(ch=='#')
72    {
73        T=NULL;
74        return false;
75    }else {
76        T=new BiThrNode;
77        T->data=ch;
78        if(PreOrderCreatBiTree(T->lchild)) T->LTag=Link;    //左孩子存在则左标志�ؓ(f��)Link
79        else T->LTag=Thread;
80        if(PreOrderCreatBiTree(T->rchild)) T->RTag=Link;    //叛_��子存在则��x��志�ؓ(f��)Link
81        else T->RTag=Thread;
82    }
83    return true;
84}
85
86
87void InOrderTraverse_Thr(BiThrTree T)
88{
89    BiThrNode *p;
90    p=T->lchild;
91    while(p!=T)
92    {
93        while(p->LTag==Link) p=p->lchild;
94        printf("%c",p->data);
95        while(p->RTag==Thread && p->rchild!=T) //if(p->RTag==Thread && p->rchild!=T)
96        {
97            p=p->rchild;
98            printf("%c",p->data);
99        }
100        p=p->rchild;
101    }
102}

Acaini.yao 2009-05-13 17:00 发表评论

国产午夜电影久久,久久精品国产网红主播,亚洲精品高清久久

矩阵转置_十字链表