Tree/ThreadTree/src/main.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

main.cpp

main.cpp 1.96 KB

//
// Created by alei_go@163.com(抖音: cyberdash_yuan) on 2020年11月1日.
//

#include "test.h"

using namespace std;

int main() {

// 测试First
 TestFirst();

// 测试Last
 TestLast();

// 测试Next(中序)
 TestNext();

// 测试Prior(中序)
 TestPrior();

// 测试Parent(中序)
 TestParent();

// 测试中序线索树中序遍历
 TestInOrderTraverseOfInOrderThread();

// 测试中序线索树前序遍历
 TestPreOrderTraverseOfInOrderThread();

// 测试中序线索树后序遍历
 TestPostOrderTraverseOfInOrderThread();

/*
 int num;
 int i = 0;

ThreadTree<int> tree;

cout << "Input the nodes num in the binary tree: ";
 cin >> num;

for (i = 0 ; i < num; i++) {
 tree.Insert_(i);
 }

tree.CreateInOrderThread();

cout << "pre order: " << endl;
 tree.PreOrderTraverse(visit);
 cout << endl;
 cout << "in order: " << endl;
 tree.InOrderTraverse(visit);
 cout << endl;
 cout << "post order: " << endl;
 tree.PostOrderTraverse(visit);
 cout << endl;

ThreadNode<int> *node = tree.First(tree.GetRoot());
 cout << "first element is :" << node->data_ << endl;

node = tree.Next(node);
 cout << "next element is :" << node->data_ << endl;

node = tree.Last(tree.GetRoot());
 cout << "last element is :" << node->data_ << endl;

node = tree.Prior(node);
 cout << "prior element is :" << node->data_ << endl;

ThreadNode<int> *t_first = tree.First(tree.GetRoot());
 ThreadNode<int> *tmp = new ThreadNode<int>(111);

tree.InsertRight(tree.First(tree.GetRoot()), tmp);

tmp = new ThreadNode<int>(222);
 tree.InsertLeft(tree.First(tree.GetRoot()), tmp);

cout << "in order: " << endl;
 tree.InOrderTraverse(visit);
 cout << endl;

tree.DeleteRight(t_first);
 tree.DeleteLeft(t_first);

cout << "in order: " << endl;
 tree.InOrderTraverse(visit);
 cout << endl;

tree.CyberDashShow();
 */
}

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

Y_Dash 提交于 2022年03月20日 22:58 +08:00 . 树更新编码格式

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

//
// Created by alei_go@163.com(抖音: cyberdash_yuan) on 2020年11月1日.
//

#include "test.h"


using namespace std;


int main() {

 // 测试First
 TestFirst();

 // 测试Last
 TestLast();

 // 测试Next(中序)
 TestNext();

 // 测试Prior(中序)
 TestPrior();

 // 测试Parent(中序)
 TestParent();

 // 测试中序线索树中序遍历
 TestInOrderTraverseOfInOrderThread();

 // 测试中序线索树前序遍历
 TestPreOrderTraverseOfInOrderThread();

 // 测试中序线索树后序遍历
 TestPostOrderTraverseOfInOrderThread();

 /*
 int num;
 int i = 0;

 ThreadTree<int> tree;

 cout << "Input the nodes num in the binary tree: ";
 cin >> num;

 for (i = 0 ; i < num; i++) {
 tree.Insert_(i);
 }

 tree.CreateInOrderThread();

 cout << "pre order: " << endl;
 tree.PreOrderTraverse(visit);
 cout << endl;
 cout << "in order: " << endl;
 tree.InOrderTraverse(visit);
 cout << endl;
 cout << "post order: " << endl;
 tree.PostOrderTraverse(visit);
 cout << endl;

 ThreadNode<int> *node = tree.First(tree.GetRoot());
 cout << "first element is :" << node->data_ << endl;

 node = tree.Next(node);
 cout << "next element is :" << node->data_ << endl;

 node = tree.Last(tree.GetRoot());
 cout << "last element is :" << node->data_ << endl;

 node = tree.Prior(node);
 cout << "prior element is :" << node->data_ << endl;

 ThreadNode<int> *t_first = tree.First(tree.GetRoot());
 ThreadNode<int> *tmp = new ThreadNode<int>(111);

 tree.InsertRight(tree.First(tree.GetRoot()), tmp);

 tmp = new ThreadNode<int>(222);
 tree.InsertLeft(tree.First(tree.GetRoot()), tmp);

 cout << "in order: " << endl;
 tree.InOrderTraverse(visit);
 cout << endl;

 tree.DeleteRight(t_first);
 tree.DeleteLeft(t_first);

 cout << "in order: " << endl;
 tree.InOrderTraverse(visit);
 cout << endl;

 tree.CyberDashShow();
 */
}