给定一棵二叉树，使用非递归的方式实现二叉树左右子树交换，并输出中序遍历结果c语言

以下是使用非递归方式实现二叉树左右子树交换，并输出中序遍历结果的 C 语言代码：

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

// 定义二叉树结点结构体
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
};

// 定义栈结构体
struct Stack {
    struct TreeNode *data[100];
    int top;
};

// 初始化栈
void initStack(struct Stack *s) {
    s->top = -1;
}

// 判断栈是否为空
int isEmpty(struct Stack *s) {
    return s->top == -1;
}

// 入栈
void push(struct Stack *s, struct TreeNode *p) {
    s->top++;
    s->data[s->top] = p;
}

// 出栈
struct TreeNode *pop(struct Stack *s) {
    struct TreeNode *p = s->data[s->top];
    s->top--;
    return p;
}

// 创建二叉树
struct TreeNode *createTree() {
    int val;
    scanf("%d", &val);
    if (val == -1) {  // -1 表示空结点
        return NULL;
    }
    struct TreeNode *root = (struct TreeNode *)malloc(sizeof(struct TreeNode));
    root->val = val;
    root->left = createTree();
    root->right = createTree();
    return root;
}

// 中序遍历二叉树
void inorderTraversal(struct TreeNode *root) {
    struct Stack s;
    initStack(&s);
    struct TreeNode *p = root;
    while (p || !isEmpty(&s)) {
        if (p) {
            push(&s, p);
            p = p->left;
        } else {
            p = pop(&s);
            printf("%d ", p->val);
            p = p->right;
        }
    }
}

// 交换二叉树的左右子树
struct TreeNode *invertTree(struct TreeNode *root) {
    struct Stack s;
    initStack(&s);
    struct TreeNode *p = root;
    while (p || !isEmpty(&s)) {
        if (p) {
            push(&s, p);
            p = p->left;
        } else {
            p = pop(&s);
            struct TreeNode *temp = p->left;
            p->left = p->right;
            p->right = temp;
            p = p->left;
        }
    }
    return root;
}

int main() {
    struct TreeNode *root = createTree();
    printf("中序遍历结果为：");
    inorderTraversal(root);
    printf("\n");
    root = invertTree(root);
    printf("交换左右子树后的中序遍历结果为：");
    inorderTraversal(root);
    printf("\n");
    return 0;
}

注意，上述代码中的栈实现采用数组实现，且数组大小为 100，该大小可根据实际情况进行调整。