C语言先序遍历逆序输出二叉树的一度结点

以下是C语言先序遍历逆序输出二叉树的一度结点的代码实现：

#include <stdio.h>
#include <stdlib.h>

// 二叉树结点的定义
typedef struct TreeNode {
    char data;
    struct TreeNode *left;
    struct TreeNode *right;
} TreeNode;

// 创建二叉树
TreeNode* createTree() {
    char ch;
    scanf("%c", &ch);
    if (ch == '#') {
        return NULL;
    }
    TreeNode *root = (TreeNode*)malloc(sizeof(TreeNode));
    root->data = ch;
    root->left = createTree();
    root->right = createTree();
    return root;
}

// 先序遍历逆序输出一度结点
void reversePreorder(TreeNode *root) {
    if (root == NULL) {
        return;
    }
    if (root->left != NULL && root->right == NULL) {
        printf("%c ", root->left->data);
    }
    if (root->left == NULL && root->right != NULL) {
        printf("%c ", root->right->data);
    }
    reversePreorder(root->left);
    reversePreorder(root->right);
}

int main() {
    TreeNode *root = createTree();
    printf("先序遍历逆序输出一度结点：");
    reversePreorder(root);
    printf("\n");
    return 0;
}