BINARY TREE

package algorithm.tree.binary;

public class Node<E> {
 
 public Node(E e){
  data = e;
 }

 E data = null;
 
 Node<E> left = null;
 Node<E> right = null; 
}
----------------------
출력을 preorder, inorder,postorder 순으로 짜볼것.