要在 Java 中打印二叉树,你需要先实现二叉树的数据结构,然后使用递归遍历二叉树,并在遍历的过程中打印节点的值。
具体实现可以参考以下代码:
classNode {
int value;
Node left;
Node right;
public Node(int value) {
this.value = value;
}
}
class BinaryTree {
Node root;
public void printTree(Node node) {
if (node == null) {
return;
}
System.out.print(node.value + " ");
printTree(node.left);
printTree(node.right);
}
}
public class Main {
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);
tree.printTree(tree.root);
}
}