public class BinaryTree { private TreeNode root; //순회 travers : (preOrder) public void preOrder(TreeNode tempNode) { if (tempNode != null) { tempNode.showNode(); preOrder(tempNode.leftNode); preOrder(tempNode.rightNode); } } //순회 travers : (inorder) public void inorder(TreeNode tempNode) { if (tempNode != null) { inorder(tempNode.leftNode); tempNode.showNode(); inorder(tempNode.rightNode); } } /..