Tree/BinaryTree/src/main.cpp · 人工智能/数据结构(C++模板实现)

Fetch the repository succeeded.

richgiteeai

Watch

Unwatch Watching Releases Only Ignoring

1 Star 0 Fork 127

人工智能/数据结构(C++模板实现)

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

Code Issues 0 Wiki Insights Pipelines

Service

Tencent Cloud Serverless

Create your Gitee Account

Explore and code with more than 14 million developers,Free private repositories !:)

Already have an account? Sign in

文件

master

Branches (3)

Manage

master

Prometheus

dev

Clone or Download

Clone/Download

HTTPS SSH SVN SVN+SSH Download ZIP

Prompt

To download the code, please copy the following command and execute it in the terminal

To ensure that your submitted code identity is correctly recognized by Gitee, please execute the following command.

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

When using the SSH protocol for the first time to clone or push code, follow the prompts below to complete the SSH configuration.

1 Generate RSA keys.

2 Obtain the content of the RSA public key and configure it in SSH Public Keys

To use SVN on Gitee, please visit the usage guide

When using the HTTPS protocol, the command line will prompt for account and password verification as follows. For security reasons, Gitee recommends configure and use personal access tokens instead of login passwords for cloning, pushing, and other operations.

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

Password for 'https://userName@gitee.com': # Private Token

Branches 3

Tags 0

data-structures-cpp

Tree

BinaryTree

src

main.cpp

main.cpp 1.45 KB

/*!
 * @file main.cpp
 * @author CyberDash计算机考研, cyberdash@163.com(抖音id:cyberdash_yuan)
 * @brief 二叉树demo演示
 * @version 0.2.1
 * @date 2020年11月01日
 */

#include "test.h"

using namespace std;

/*!
 * @brief **main函数**
 * @return 0
 * @note
 * main函数
 * -------
 * -------
 *
 * -------
 * 测试-二叉树-复制构造函数\n
 * 测试-二叉树-高度\n
 * 测试-二叉树-获取父节点\n
 * 测试-二叉树-前序遍历\n
 * 测试-二叉树-中序遍历\n
 * 测试-二叉树-后序遍历\n
 * 测试-二叉树-层序遍历\n
 * 测试-二叉树-是否存在结点\n
 * 测试-二叉树-前序遍历与中序遍历生成二叉树\n
 *
 *
 * -------
 */
int main() {

// 测试-二叉树-复制构造函数
	BinaryTreeTest::TestCopyConstructor();

// 测试-二叉树-高度
	BinaryTreeTest::TestHeight();

// 测试-二叉树-获取父节点
	BinaryTreeTest::TestParent();

// 测试-二叉树-前序遍历
 BinaryTreeTest::TestPreorderTraversal();

// 测试-二叉树-中序遍历
 BinaryTreeTest::TestInorderTraversal();

// 测试-二叉树-后序遍历
 BinaryTreeTest::TestPostorderTraversal();

// 测试-二叉树-层序遍历
 BinaryTreeTest::TestLevelOrderTraversal();

// 测试-二叉树-是否存在结点
 BinaryTreeTest::TestExist();

// 测试-二叉树-前序遍历与中序遍历生成二叉树
 BinaryTreeTest::TestCreateByPreorderAndInorderList();

return 0;
}

Copy Edit Raw Blame History

Y_Dash authored 2023年06月24日 16:11 +08:00 . binary tree增加编译选项

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

/*!
 * @file main.cpp
 * @author CyberDash计算机考研, cyberdash@163.com(抖音id:cyberdash_yuan)
 * @brief 二叉树demo演示
 * @version 0.2.1
 * @date 2020年11月01日
 */

#include "test.h"


using namespace std;


/*!
 * @brief **main函数**
 * @return 0
 * @note
 * main函数
 * -------
 * -------
 *
 * -------
 * 测试-二叉树-复制构造函数\n
 * 测试-二叉树-高度\n
 * 测试-二叉树-获取父节点\n
 * 测试-二叉树-前序遍历\n
 * 测试-二叉树-中序遍历\n
 * 测试-二叉树-后序遍历\n
 * 测试-二叉树-层序遍历\n
 * 测试-二叉树-是否存在结点\n
 * 测试-二叉树-前序遍历与中序遍历生成二叉树\n
 *
 *
 * -------
 */
int main() {

 // 测试-二叉树-复制构造函数
	BinaryTreeTest::TestCopyConstructor();

 // 测试-二叉树-高度
	BinaryTreeTest::TestHeight();

 // 测试-二叉树-获取父节点
	BinaryTreeTest::TestParent();

 // 测试-二叉树-前序遍历
 BinaryTreeTest::TestPreorderTraversal();

 // 测试-二叉树-中序遍历
 BinaryTreeTest::TestInorderTraversal();

 // 测试-二叉树-后序遍历
 BinaryTreeTest::TestPostorderTraversal();

 // 测试-二叉树-层序遍历
 BinaryTreeTest::TestLevelOrderTraversal();

 // 测试-二叉树-是否存在结点
 BinaryTreeTest::TestExist();

 // 测试-二叉树-前序遍历与中序遍历生成二叉树
 BinaryTreeTest::TestCreateByPreorderAndInorderList();

	return 0;
}