二叉树中序遍历（非递归非栈法 C语言版）

morningcat2018

已于 2022-05-20 01:07:03 修改

阅读量646

点赞数 2

分类专栏：算法与数据结构文章标签：二叉树插入中序遍历 C++ 数据结构

于 2021-02-08 14:06:41 首次发布

本文链接：https://blog.csdn.net/u013837825/article/details/113756063

版权

算法与数据结构专栏收录该内容

16 篇文章 0 订阅

订阅专栏

#ifndef HELLOCPLUS_TREE_TEST_H
#define HELLOCPLUS_TREE_TEST_H

struct TreeNode {
    int value;
    TreeNode *leftChild;
    TreeNode *rightChild;
    TreeNode(int x) : value(x), leftChild(NULL), rightChild(NULL) {}
};

TreeNode *getTree(int length);

void *inorderTraversal(TreeNode *root);

#endif //HELLOCPLUS_TREE_TEST_H

#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#include "tree_test.h"

TreeNode *addNode(TreeNode *head, int value) {
    if (head == NULL) {
        head = (TreeNode *) malloc(sizeof(TreeNode));
        head->value = value;
        head->leftChild = NULL;
        head->rightChild = NULL;
    } else if (value >= head->value) {
        head->rightChild = addNode(head->rightChild, value);
    } else {
        head->leftChild = addNode(head->leftChild, value);
    }
}

TreeNode *getTree(int length) {
    srand((unsigned) time(NULL));
    TreeNode *head = NULL;
    TreeNode *p = NULL;
    for (int i = 0; i < length; i++) {
        if (head == NULL) {
            head = addNode(head, rand());
            p = head;
        } else {
            p = addNode(p, rand());
        }
    }
    return head;
}

void *inorderTraversal(TreeNode *root) {
    TreeNode *cur = root;
    TreeNode *prev = NULL;
    TreeNode *head = NULL;

    while (cur != NULL) {
        if (cur->leftChild == NULL) {
            printf("%d ", cur->value);
            cur = cur->rightChild;
        } else {
            // find predecessor
            prev = cur->leftChild;
            while (prev->rightChild != NULL
                   && prev->rightChild != cur) {
                prev = prev->rightChild;
            }

            if (prev->rightChild == NULL) {
                prev->rightChild = cur;
                cur = cur->leftChild;
            } else {
                prev->rightChild = NULL;
                printf("%d ", cur->value);
                cur = cur->rightChild;
            }
        }
    }
}