后序序列建立二叉树C语言
时间: 2023-12-29 08:04:14 浏览: 26
根据后序序列建立二叉树的C语言实现如下:
```c
#include <stdio.h>
#include <stdlib.h>
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
};
struct TreeNode* buildTree(int* inorder, int inorderSize, int* postorder, int postorderSize) {
if (inorderSize == 0 || postorderSize == 0) {
return NULL;
}
struct TreeNode* root = (struct TreeNode*)malloc(sizeof(struct TreeNode));
root->val = postorder[postorderSize - 1];
int i; for (i = 0; i < inorderSize; i++) {
if (inorder[i] == root->val) {
break;
}
}
root->left = buildTree(inorder, i, postorder, i);
root->right = buildTree(inorder + i + 1, inorderSize - i - 1, postorder + i, postorderSize - i - 1);
return root;
}
int main() {
int inorder[] = {9, 3, 15, 20, 7};
int postorder[] = {9, 15, 7, 20, 3};
int inorderSize = sizeof(inorder) / sizeof(inorder[0]);
int postorderSize = sizeof(postorder) / sizeof(postorder[0]);
struct TreeNode* root = buildTree(inorder, inorderSize, postorder, postorderSize);
return 0;
}
```