public class BinaryTree{
protected Node root;
protected int size = 0;
protected INodeCreator creator = null;
public BinaryTree(){
root = null;
}
final public void insertLeft(E data, Node node){
if(node.left != null){
System.out.println("왼쪽 노드가 ì´ë¯¸ 차있ìŒ");
return ;
}
if(root == null){
root = node;
}
Node newNode = new Node(data);
node.left = newNode;
}
final public void insertRight(E data, Node node){
if(node.right != null){
System.out.println("오른쪽 노드가 ì´ë¯¸ 차있ìŒ");
return ;
}
if(root == null){
root = node;
}
Node newNode = new Node(data);
node.right = newNode;
}
protected int getMaxLevel(Node node){
if(node == null)
return 0;
return java.lang.Math.max(getMaxLevel(node.left), getMaxLevel(node.right)) + 1;
}
public void printPreOrder(){
BinaryTreePrinter.printPreOrder(root);
}
public void printInOrder(){
BinaryTreePrinter.printInOrder(root);
}
public void printPostOrder(){
BinaryTreePrinter.printPostOrder(root);
}
public void printLevelOrder(){
BinaryTreePrinter.printLevelOrder(root);
}
public void printBFS(){
BinaryTreePrinter.printBFS(root);
}
public void print(){
BinaryTreePrinter.print(root);
}
public static class Node{
// Inner class ì—서는 private ë¼ë„ 멤버 변수 ì ‘ê·¼ 가능함!
public E element;
public Node parent;
public Node left;
public Node right;
public Node(){
this.left = null;
this.right = null;
}
public Node(E element){
this.element = element;
this.left = null;
this.right = null;
}
public Node(E element,Node parent){
this.parent = parent;
this.element = element;
this.left = null;
this.right = null;
}
public void visit(){
System.out.print(element);
}
}
protected static interface INodeCreator> {
public Node createNewNode(E id,Node parent);
}
}