1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196
| #include <iostream> #include<bits/stdc++.h> using namespace std; #define ArraySize 6
struct Node { int value; struct Node *left_node; struct Node *right_node; }; typedef struct Node TNode; typedef TNode *BTree; BTree bTree;
void Add_Node(int value) { TNode *newNode; BTree currentNode; int flag = 0;
newNode = (TNode *)malloc(sizeof(TNode)); newNode->value = value; newNode->left_node = NULL; newNode->right_node = NULL; if(bTree == NULL) bTree = newNode; else { currentNode = bTree; while(!flag) { if(value<currentNode->value) { if(currentNode->left_node==NULL) { currentNode->left_node=newNode; flag=1; } else currentNode=currentNode->left_node; } else { if(currentNode->right_node==NULL) { currentNode->right_node=newNode; flag=1; } else currentNode=currentNode->right_node; } } } }
void Preorder(BTree bTree) { if(bTree!=NULL) { cout<<bTree->value<<" "; Preorder(bTree->left_node); Preorder(bTree->right_node); } }
void Preorder2(BTree bTree) { BTree stack[ArraySize]; int top=0; BTree p=bTree; while(p||top!=0) { if(p) { cout<<p->value<<" "; stack[top++]=p; p=p->left_node; } else { p=stack[--top]; p=p->right_node; } } }
void Inorder(BTree bTree) { if(bTree!=NULL) { Inorder(bTree->left_node); cout<<bTree->value<<" "; Inorder(bTree->right_node); } }
void Inorder2(BTree bTree) { BTree stack[ArraySize]; int top=0; BTree p=bTree; while(p||top!=0) { if(p) { stack[top++]=p; p=p->left_node; } else { p=stack[--top]; cout<<p->value<<" "; p=p->right_node; } } }
void Postorder(BTree bTree) { if(bTree!=NULL) { Postorder(bTree->left_node); Postorder(bTree->right_node); cout<<bTree->value<<" "; }
}
void Postorder2(BTree bTree) { BTree stack1[ArraySize]; int stack2[ArraySize]; int top1=0,top2=0; int flag; BTree p=bTree; while(p||top1!=0) { if(p) { stack1[top1++]=p; stack2[top2++]=0; p=p->left_node; } else { p=stack1[top1-1]; flag=stack2[top2-1]; if(flag==0) { stack2[top2-1]=1; p=p->right_node; } else { p=stack1[--top1]; --top2; cout<<p->value<<" "; p=NULL; } } } }
int main() { int content[ArraySize]; cout<<"请输入6个整数:"<<endl; for(int i=0;i<ArraySize;i++) cin>>content[i]; for(int i=0;i<ArraySize;i++) Add_Node(content[i]); cout<<"建树完成!"<<endl; cout<<"递归前序遍历:"; Preorder(bTree); cout<<"非递归前序遍历:"; Preorder2(bTree); cout<<endl;
cout<<"递归中序遍历:"; Inorder(bTree); cout<<"非递归中序遍历:"; Inorder2(bTree); cout<<endl;
cout<<"递归后序遍历:"; Postorder(bTree); cout<<"非递归后序遍历:"; Postorder2(bTree); cout<<endl; return 0; }
|