Tree/ThreadTree/src/test.cpp · yangchao/Data-Structure-Cpp

代码拉取完成,页面将自动刷新

扫描微信二维码支付

取消

支付完成

richgiteeai

Watch

不关注关注所有动态仅关注版本发行动态关注但不提醒动态

1 Star 0 Fork 127

yangchao/Data-Structure-Cpp

forked from cyberdash/数据结构(C++模板实现)

代码 Issues 0 Wiki 统计流水线

服务

加入 Gitee

与超过 1400万开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)

免费加入

已有帐号? 立即登录

文件

master

分支 (6)

管理

master

dev

dev_old

dev_lzy

dev_gyl

dev_doc

克隆/下载

HTTPS SSH SVN SVN+SSH 下载ZIP

提示

下载代码请复制以下命令到终端执行

为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置

git config --global user.name userName 
git config --global user.email userEmail

初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置

1 生成 RSA 密钥

2 获取 RSA 公钥内容,并配置到 SSH公钥中

在 Gitee 上使用 SVN,请访问使用指南

使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议配置并使用私人令牌替代登录密码进行克隆、推送等操作

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # 私人令牌

分支 6

标签 0

data-structure-cpp

Tree

ThreadTree

src

test.cpp

test.cpp 12.76 KB

//
// Created by cyberdash@163.com(抖音: cyberdash_yuan) on 2021年4月19日.
//

#include "test.h"

void visit(ThreadNode<int>* node_ptr) {
 cout << node_ptr->data << " ";
};

void TestFirst() {

cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree First Node |"<<endl;
 cout<<"| 测试中序线索树第一个线索节点 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

int count = 7;

ThreadTree<int> in_order_thread_tree;

for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

in_order_thread_tree.CreateInOrderThread();

ThreadNode<int>* root_ptr = in_order_thread_tree.Root();

ThreadNode<int>* first_node_ptr = in_order_thread_tree.First(root_ptr);

cout << "中序线索第一个线索节点 :" << first_node_ptr->data << endl;

cout<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}

void TestLast() {

cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree Last Node |"<<endl;
 cout<<"| 测试中序线索树最后一个线索节点 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

int count = 7;

ThreadTree<int> in_order_thread_tree;

for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

in_order_thread_tree.CreateInOrderThread();

ThreadNode<int>* root_ptr = in_order_thread_tree.Root();

ThreadNode<int>* last_node_ptr = in_order_thread_tree.Last(root_ptr);

cout << "中序线索最后一个线索节点: " << last_node_ptr->data << endl;

cout<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}

void TestNext() {

cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree Next Node |"<<endl;
 cout<<"| 测试中序线索树下一个线索节点 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

int count = 7;

ThreadTree<int> in_order_thread_tree;

for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

in_order_thread_tree.CreateInOrderThread();

ThreadNode<int>* first_node_ptr = in_order_thread_tree.First(in_order_thread_tree.Root());

ThreadNode<int>* second_node_ptr = in_order_thread_tree.Next(first_node_ptr);
 ThreadNode<int>* third_node_ptr = in_order_thread_tree.Next(second_node_ptr);
 ThreadNode<int>* forth_node_ptr = in_order_thread_tree.Next(third_node_ptr);

cout << "中序线索树第1个线索节点: " << first_node_ptr->data << endl;
 cout << "中序线索树第2个线索节点: " << second_node_ptr->data << endl;
 cout << "中序线索树第3个线索节点: " << third_node_ptr->data << endl;
 cout << "中序线索树第4个线索节点: " << forth_node_ptr->data << endl;

cout<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}

void TestPrior() {

cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree Prior Node |"<<endl;
 cout<<"| 测试中序线索树前一个线索节点 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

int count = 7;

ThreadNode<int>* node_ptr_array[4];
 ThreadTree<int> in_order_thread_tree;

for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

in_order_thread_tree.CreateInOrderThread();

node_ptr_array[0] = in_order_thread_tree.First(in_order_thread_tree.Root());

for (int i = 1; i < 4; i++) {
 node_ptr_array[i] = in_order_thread_tree.Next(node_ptr_array[i - 1]);
 }

for (int i = 3; i >=1; i--) {
 ThreadNode<int>* prior_node_ptr = in_order_thread_tree.Prior(node_ptr_array[i]);
 cout << "中序线索树第" << i << "个线索节点: " << prior_node_ptr->data << endl; // (i - 1) + 1 = i
 }

cout<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}

/*
 * 中序线索二叉树Parent
 */
void TestParent() {

cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree Parent Node |"<<endl;
 cout<<"| 测试中序线索树父节点 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

int count = 7;

ThreadTree<int> in_order_thread_tree;

for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

in_order_thread_tree.CreateInOrderThread();

ThreadNode<int>* root_ptr = in_order_thread_tree.Root();
 ThreadNode<int>* root_parent_ptr = in_order_thread_tree.Parent(root_ptr);

ThreadNode<int>* first_node_ptr = in_order_thread_tree.First(root_ptr);
 ThreadNode<int>* first_parent_ptr = in_order_thread_tree.Parent(first_node_ptr);
 ThreadNode<int>* first_parent_parent_ptr = in_order_thread_tree.Parent(first_parent_ptr);

if (root_parent_ptr != NULL) {
 cout << "根节点的父节点: " << root_parent_ptr->data << endl;
 } else {
 cout<<"根节点的父节点为NULL"<<endl;
 }

cout << "第一个线索节点: " << first_node_ptr->data << endl;
 cout << "第一个线索节点的父节点: " << first_parent_ptr->data << endl;
 cout << "第一个线索节点的父节点的父节点: " << first_parent_parent_ptr->data << endl;

cout<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}

void TestInOrderTraverseOfInOrderThread() {

cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree InOrderTraverse |"<<endl;
 cout<<"| 测试中序线索树中序遍历 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

int count = 7;
 ThreadTree<int> in_order_thread_tree;

for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

in_order_thread_tree.CreateInOrderThread();

cout<<"中序线索树, 中序遍历: "<<endl;
 in_order_thread_tree.InOrderTraverse(visit);

cout<<endl<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}

void TestPreOrderTraverseOfInOrderThread() {

cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree PreOrderTraverse |"<<endl;
 cout<<"| 测试中序线索树前序遍历 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

int count = 7;
 ThreadTree<int> in_order_thread_tree;

for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

in_order_thread_tree.CreateInOrderThread();

cout<<"中序线索树, 前序遍历: "<<endl;
 in_order_thread_tree.PreOrderTraverse(visit);

cout<<endl<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}

void TestPostOrderTraverseOfInOrderThread() {

cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree PostOrderTraverse |"<<endl;
 cout<<"| 测试中序线索树后序遍历 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

int count = 7;
 ThreadTree<int> in_order_thread_tree;

for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

in_order_thread_tree.CreateInOrderThread();

cout<<"中序线索树, 后序遍历: "<<endl;
 in_order_thread_tree.PostOrderTraverse(visit);

cout<<endl<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}

一键复制编辑原始数据按行查看历史

Y_Dash 提交于 2022年02月16日 15:25 +08:00 . unicodify the code of threadtree

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 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319

//
// Created by cyberdash@163.com(抖音: cyberdash_yuan) on 2021年4月19日.
//

#include "test.h"


void visit(ThreadNode<int>* node_ptr) {
 cout << node_ptr->data << " ";
};


void TestFirst() {

 cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree First Node |"<<endl;
 cout<<"| 测试中序线索树第一个线索节点 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

 int count = 7;

 ThreadTree<int> in_order_thread_tree;

 for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

 in_order_thread_tree.CreateInOrderThread();

 ThreadNode<int>* root_ptr = in_order_thread_tree.Root();

 ThreadNode<int>* first_node_ptr = in_order_thread_tree.First(root_ptr);

 cout << "中序线索第一个线索节点 :" << first_node_ptr->data << endl;

 cout<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}


void TestLast() {

 cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree Last Node |"<<endl;
 cout<<"| 测试中序线索树最后一个线索节点 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

 int count = 7;

 ThreadTree<int> in_order_thread_tree;

 for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

 in_order_thread_tree.CreateInOrderThread();

 ThreadNode<int>* root_ptr = in_order_thread_tree.Root();

 ThreadNode<int>* last_node_ptr = in_order_thread_tree.Last(root_ptr);

 cout << "中序线索最后一个线索节点: " << last_node_ptr->data << endl;

 cout<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}


void TestNext() {

 cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree Next Node |"<<endl;
 cout<<"| 测试中序线索树下一个线索节点 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

 int count = 7;

 ThreadTree<int> in_order_thread_tree;

 for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

 in_order_thread_tree.CreateInOrderThread();

 ThreadNode<int>* first_node_ptr = in_order_thread_tree.First(in_order_thread_tree.Root());

 ThreadNode<int>* second_node_ptr = in_order_thread_tree.Next(first_node_ptr);
 ThreadNode<int>* third_node_ptr = in_order_thread_tree.Next(second_node_ptr);
 ThreadNode<int>* forth_node_ptr = in_order_thread_tree.Next(third_node_ptr);

 cout << "中序线索树第1个线索节点: " << first_node_ptr->data << endl;
 cout << "中序线索树第2个线索节点: " << second_node_ptr->data << endl;
 cout << "中序线索树第3个线索节点: " << third_node_ptr->data << endl;
 cout << "中序线索树第4个线索节点: " << forth_node_ptr->data << endl;

 cout<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}


void TestPrior() {

 cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree Prior Node |"<<endl;
 cout<<"| 测试中序线索树前一个线索节点 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

 int count = 7;

 ThreadNode<int>* node_ptr_array[4];
 ThreadTree<int> in_order_thread_tree;

 for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

 in_order_thread_tree.CreateInOrderThread();

 node_ptr_array[0] = in_order_thread_tree.First(in_order_thread_tree.Root());

 for (int i = 1; i < 4; i++) {
 node_ptr_array[i] = in_order_thread_tree.Next(node_ptr_array[i - 1]);
 }

 for (int i = 3; i >=1; i--) {
 ThreadNode<int>* prior_node_ptr = in_order_thread_tree.Prior(node_ptr_array[i]);
 cout << "中序线索树第" << i << "个线索节点: " << prior_node_ptr->data << endl; // (i - 1) + 1 = i
 }

 cout<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}


/*
 * 中序线索二叉树Parent
 */
void TestParent() {

 cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree Parent Node |"<<endl;
 cout<<"| 测试中序线索树父节点 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

 int count = 7;

 ThreadTree<int> in_order_thread_tree;

 for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

 in_order_thread_tree.CreateInOrderThread();

 ThreadNode<int>* root_ptr = in_order_thread_tree.Root();
 ThreadNode<int>* root_parent_ptr = in_order_thread_tree.Parent(root_ptr);

 ThreadNode<int>* first_node_ptr = in_order_thread_tree.First(root_ptr);
 ThreadNode<int>* first_parent_ptr = in_order_thread_tree.Parent(first_node_ptr);
 ThreadNode<int>* first_parent_parent_ptr = in_order_thread_tree.Parent(first_parent_ptr);

 if (root_parent_ptr != NULL) {
 cout << "根节点的父节点: " << root_parent_ptr->data << endl;
 } else {
 cout<<"根节点的父节点为NULL"<<endl;
 }

 cout << "第一个线索节点: " << first_node_ptr->data << endl;
 cout << "第一个线索节点的父节点: " << first_parent_ptr->data << endl;
 cout << "第一个线索节点的父节点的父节点: " << first_parent_parent_ptr->data << endl;

 cout<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}


void TestInOrderTraverseOfInOrderThread() {

 cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree InOrderTraverse |"<<endl;
 cout<<"| 测试中序线索树中序遍历 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

 int count = 7;
 ThreadTree<int> in_order_thread_tree;

 for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

 in_order_thread_tree.CreateInOrderThread();

 cout<<"中序线索树, 中序遍历: "<<endl;
 in_order_thread_tree.InOrderTraverse(visit);

 cout<<endl<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}


void TestPreOrderTraverseOfInOrderThread() {

 cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree PreOrderTraverse |"<<endl;
 cout<<"| 测试中序线索树前序遍历 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

 int count = 7;
 ThreadTree<int> in_order_thread_tree;

 for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

 in_order_thread_tree.CreateInOrderThread();

 cout<<"中序线索树, 前序遍历: "<<endl;
 in_order_thread_tree.PreOrderTraverse(visit);

 cout<<endl<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}


void TestPostOrderTraverseOfInOrderThread() {

 cout<<endl;
 cout<<"|------------------------ CyberDash ------------------------|"<<endl;
 cout<<"| Test InOrder ThreadTree PostOrderTraverse |"<<endl;
 cout<<"| 测试中序线索树后序遍历 |"<<endl;
 cout<<"| |"<<endl;
 cout<<"| 0 |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| / \\ |"<<endl;
 cout<<"| 1 2 |"<<endl;
 cout<<"| / \\ / |"<<endl;
 cout<<"| 3 5 4 |"<<endl;
 cout<<"| / |"<<endl;
 cout<<"| 6 |"<<endl<<endl;

 int count = 7;
 ThreadTree<int> in_order_thread_tree;

 for (int i = 0 ; i < count; i++) {
 in_order_thread_tree.Insert(i);
 }

 in_order_thread_tree.CreateInOrderThread();

 cout<<"中序线索树, 后序遍历: "<<endl;
 in_order_thread_tree.PostOrderTraverse(visit);

 cout<<endl<<endl<<"------------------------- CyberDash -------------------------"<<endl;
 cout<<endl;
}