前序遍历树伪代码java
时间: 2023-04-02 07:03:51 浏览: 87
前序遍历树的伪代码Java实现如下:void preOrder(TreeNode root) {
if (root == null) {
return;
}
// 先访问根节点
System.out.println(root.val);
// 然后依次递归遍历左右子树
preOrder(root.left);
preOrder(root.right);
}
相关问题
前序遍历的java代码
以下是前序遍历的Java代码示例:
```
class Node {
int val;
Node left;
Node right;
Node(int val) {
this.val = val;
left = null;
right = null;
}
}
public class PreorderTraversal {
public static void preorder(Node root) {
if (root != null) {
System.out.print(root.val + " ");
preorder(root.left);
preorder(root.right);
}
}
public static void main(String[] args) {
Node root = new Node(1);
root.left = new Node(2);
root.right = new Node(3);
root.left.left = new Node(4);
root.left.right = new Node(5);
System.out.print("Preorder traversal: ");
preorder(root);
}
}
```
输出:
```
Preorder traversal: 1 2 4 5 3
```
二叉树的前序遍历C++实现代码
以下是二叉树的前序遍历C实现代码:
```c
#include <stdio.h>
#include <stdlib.h>
typedef struct TreeNode {
int val;
struct TreeNode* left;
struct TreeNode* right;
} TreeNode;
void preOrder(TreeNode* root) {
if(root == NULL)
return;
printf("%d ", root -> val);
preOrder(root -> left);
preOrder(root -> right);
}
int main() {
TreeNode* root = (TreeNode*)malloc(sizeof(TreeNode));
root -> val = 1;
root -> left = (TreeNode*)malloc(sizeof(TreeNode));
root -> left -> val = 2;
root -> left -> left = NULL;
root -> left -> right = NULL;
root -> right = (TreeNode*)malloc(sizeof(TreeNode));
root -> right -> val = 3;
root -> right -> left = (TreeNode*)malloc(sizeof(TreeNode));
root -> right -> left -> val = 4;
root -> right -> left -> left = NULL;
root -> right -> left -> right = NULL;
root -> right -> right = (TreeNode*)malloc(sizeof(TreeNode));
root -> right -> right -> val = 5;
root -> right -> right -> left = NULL;
root -> right -> right -> right = NULL;
preOrder(root);
return 0;
}
```
这是一个简单的二叉树数据结构,使用前序遍历方法输出树的节点值。前序遍历的顺序是:先遍历根节点,再遍历左子树,最后遍历右子树。在这个实现中,我们使用了递归来遍历二叉树。
相关推荐
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)