package BinaryTree;import java.util.Scanner;public class BinaryTree {public static void main(String[] args) { } public Treenode createbinarytree(Treenode node, Scanner scan) {//創建 String tmp = scan.next(); if (scan.next().equals("0"))? { return node = null; }? else? { node = new Treenode(tmp); { node.setLchild(createbinarytree(node.getLchild(), scan)); node.setRchild(createbinarytree(node.getRchild(), scan)); return node; } } } public void preoder(Treenode node) {//遍歷 if (node!=null) { System.out.println( node.getData()); preoder(node.getLchild()); preoder(node.getRchild()); } }}package BinaryTree; import java.util.Scanner; public class Test { public static void main(String[] args) { BinaryTree bint=new BinaryTree(); Treenode node=new Treenode(); Treenode node1; System.out.println("請開始輸入二叉樹節點，輸入0結束"); Scanner scan=new Scanner(System.in); node1=bint.createbinarytree(node, scan); bint.preoder(node1); } }