写一个java二叉树遍历
时间: 2023-03-13 22:16:53 浏览: 53
我可以给你一个Java代码的例子来演示二叉树的遍历:public class BinaryTree {
Node root;
public void traverseInOrder(Node node) {
if (node != null) {
traverseInOrder(node.left);
System.out.print(" " + node.data);
traverseInOrder(node.right);
}
}
public static void main(String[] args) {
BinaryTree tree = new BinaryTree();
tree.root = new Node(1);
tree.root.left = new Node(2);
tree.root.right = new Node(3);
tree.root.left.left = new Node(4);
tree.root.left.right = new Node(5);
System.out.println("中序遍历:");
tree.traverseInOrder(tree.root);
}
}
class Node {
int data;
Node left;
Node right;
public Node(int data) {
this.data = data;
left = null;
right = null;
}
}