C语言：用Queue实现二叉树轴对称检查（附代码示例）

以下是使用 C 语言和队列来检查二叉树是否轴对称的示例代码： ```c #include <stdio.h> #include <stdlib.h> #include <stdbool.h> // 二叉树节点结构体 typedef struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; } TreeNode; // 创建新节点 TreeNode *newNode(int val) { TreeNode *node = (TreeNode *)malloc(sizeof(TreeNode)); node->val = val; node->left = NULL; node->right = NULL; return node; } // 检查二叉树是否轴对称 bool isSymmetric(TreeNode *root) { if (root == NULL) { return true; } // 创建两个队列 TreeNode queue1 = (TreeNode )malloc(sizeof(TreeNode *) * 1000); TreeNode queue2 = (TreeNode )malloc(sizeof(TreeNode *) * 1000); int front1 = 0, rear1 = 0, front2 = 0, rear2 = 0; queue1[rear1++] = root->left; queue2[rear2++] = root->right; while (front1 < rear1 && front2 < rear2) { TreeNode *node1 = queue1[front1++]; TreeNode *node2 = queue2[front2++]; if (node1 == NULL && node2 == NULL) { continue; } if (node1 == NULL || node2 == NULL || node1->val!= node2->val) { free(queue1); free(queue2); return false; } queue1[rear1++] = node1->left; queue1[rear1++] = node1->right; queue2[rear2++] = node2->right; queue2[rear2++] = node2->left; } free(queue1); free(queue2); return true; } // 测试示例 int main() { // 构建测试二叉树 TreeNode *root = newNode(1); root->left = newNode(2); root->right = newNode(2); root->left->left = newNode(3); root->left->right = newNode(4); root->right->left = newNode(4); root->right->right = newNode(3); if (isSymmetric(root)) { printf("二叉树是轴对称的\n"); } else { printf("二叉树不是轴对称的\n"); } return 0; } ``` 这段代码首先定义了二叉树的节点结构体，然后实现了创建新节点、使用队列检查二叉树是否轴对称的函数。在 `main` 函数中构建了一个测试二叉树并进行判断。 ######[AI写代码神器 | 679点数解答 | 2024-09-12 22:19:57]