10.二叉树按照二叉链表存储,编写算法将二叉树的左右子树进行交换。C语言代码
时间: 2023-10-31 09:04:24 浏览: 51
下面是用C语言编写的算法,用于将二叉树的左右子树进行交换:
```c
#include <stdio.h>
#include <stdlib.h>
struct TreeNode {
int value;
struct TreeNode* left;
struct TreeNode* right;
};
void swapSubtrees(struct TreeNode* root) {
if (root == NULL) {
return;
}
// 递归交换左右子树
swapSubtrees(root->left);
swapSubtrees(root->right);
// 交换左右子树节点指针
struct TreeNode* temp = root->left;
root->left = root->right;
root->right = temp;
}
void printTree(struct TreeNode* root) {
if (root == NULL) {
return;
}
printf("%d ", root->value);
printTree(root->left);
printTree(root->right);
}
int main() {
// 创建一个二叉树
struct TreeNode* root = (struct TreeNode*)malloc(sizeof(struct TreeNode));
root->value = 1;
root->left = (struct TreeNode*)malloc(sizeof(struct TreeNode));
root->left->value = 2;
root->right = (struct TreeNode*)malloc(sizeof(struct TreeNode));
root->right->value = 3;
root->left->left = (struct TreeNode*)malloc(sizeof(struct TreeNode));
root->left->left->value = 4;
root->left->right = (struct TreeNode*)malloc(sizeof(struct TreeNode));
root->left->right->value = 5;
// 交换左右子树
swapSubtrees(root);
// 打印交换后的二叉树
printTree(root);
return 0;
}
```
运行上述代码,将会输出交换后的二叉树的先序遍历结果:
```
1 3 2 5 4
```
以上是用C语言实现的算法,用于将二叉树的左右子树进行交换。