首页C语言的二叉树先序遍历代码

C语言的二叉树先序遍历代码

时间: 2023-07-09 22:18:34 浏览: 128

好的，以下是 C 语言的二叉树先序遍历代码： ```c #include <stdio.h> #include <stdlib.h> // 二叉树结构体 struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; }; // 递归实现二叉树先序遍历 void preorderTraversal(struct TreeNode* root) { if (root == NULL) { return; } printf("%d ", root->val); // 先输出当前节点的值 preorderTraversal(root->left); // 再遍历左子树 preorderTraversal(root->right); // 最后遍历右子树 } int main() { // 创建一棵二叉树 struct TreeNode* root = (struct TreeNode*)malloc(sizeof(struct TreeNode)); root->val = 1; root->left = (struct TreeNode*)malloc(sizeof(struct TreeNode)); root->left->val = 2; root->left->left = NULL; root->left->right = NULL; root->right = (struct TreeNode*)malloc(sizeof(struct TreeNode)); root->right->val = 3; root->right->left = (struct TreeNode*)malloc(sizeof(struct TreeNode)); root->right->left->val = 4; root->right->left->left = NULL; root->right->left->right = NULL; root->right->right = (struct TreeNode*)malloc(sizeof(struct TreeNode)); root->right->right->val = 5; root->right->right->left = NULL; root->right->right->right = NULL; // 先序遍历二叉树 printf("二叉树的先序遍历结果为: "); preorderTraversal(root); // 释放二叉树内存 free(root->left); free(root->right->left); free(root->right->right); free(root->right); free(root); return 0; } ``` 该代码创建了一棵二叉树，然后调用 `preorderTraversal` 函数对其进行先序遍历。

阅读全文