C++编写数据结构中的二叉树(前序，中序，后序遍历)

最新推荐文章于 2022-10-31 15:43:09 发布

mpz129

最新推荐文章于 2022-10-31 15:43:09 发布

阅读量1.1k

点赞数 1

CC 4.0 BY-SA版权

分类专栏：数据结构文章标签： C++ IOS 二叉树遍历

本文链接：https://blog.youkuaiyun.com/mpz129/article/details/22954209

数据结构专栏收录该内容

1 篇文章

订阅专栏

本文介绍了如何使用C++语言创建一个二叉搜索树，并实现前序、中序和后序遍历算法。通过实例演示了如何在树中插入节点、遍历树结构以获取有序数据。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

编译环境xCode 5.1

Two.h:

#ifndef __OK__Two__
#define __OK__Two__

#include <iostream>
typedef struct List{
    char name[20];
    char desc[200];
    int num;
    List *next;
}List;


typedef struct myTree{
    int data;
    char stu_name[20];
    char desc[200];
    int num;
    myTree *lChild;
    myTree *rChild;
}tree;


class listtree {
    
public:
    void createTree(int,int[],char*[]);
    void preOrder(tree *);//前序遍历
    void inOrder(tree *);//中序遍历
    void postOrder(tree *);//后序遍历
    myTree *rootNode;
};


#endif /* defined(__OK__Two__) */

Two.cpp

#include "Two.h"
void listtree::createTree(int count,int num[],char *names[]){
    int index = count;
    tree *currentNode = NULL;
    while (index) {
        tree *node = new tree;
        int id = count-index;
        node->data = num[id];
        strcpy(node->stu_name, names[id]);
        node->lChild = NULL;
        node->rChild = NULL;
        if (rootNode==NULL) {
            rootNode = node;
            
        }else{
            currentNode = rootNode;
            tree *thisNode = NULL;
            while (currentNode!=NULL) {
                thisNode = currentNode;
                if (currentNode->data>node->data) {
                    currentNode = currentNode->lChild;
                }else {
                    currentNode = currentNode->rChild;
                }
            }
            if(node->data>thisNode->data){
                thisNode->rChild = node;
            }else{
                thisNode->lChild = node;
            }
            currentNode = node;
        }
        index--;
    }
}
void listtree::preOrder(tree *node){
    if (node==NULL) {
        return;
    }
    std::cout<<node->data<<"++"<<node->stu_name<<"++"<<"\n";
    preOrder(node->lChild);
    preOrder(node->rChild);
}
void listtree::inOrder(tree *node){
    if (node==NULL) {
        return;
    }
    inOrder(node->lChild);
    std::cout<<node->data<<"++"<<node->stu_name<<"++"<<"\n";
    inOrder(node->rChild);
}
void listtree::postOrder(tree *node){
    if (node==NULL) {
        return;
    }
    postOrder(node->lChild);
    postOrder(node->rChild);
    std::cout<<node->data<<"++"<<node->stu_name<<"++"<<"\n";
}