[Java] 이진 트리를 순회하는 알고리즘

class TreeNode { TreeNode Lchild; Object data; TreeNode Rchild; } class BirnaryTree{ public static int count; public static TreeNode createBT() { return new TreeNode(); } public boolean isEmpty(TreeNode p) { if(p == null) return true; else return false; } public void makeBT(TreeNode node, TreeNode LC, Object data, TreeNode RC) { node.Lchild = LC; node.data = data; node.Rchild = RC; } public Tree..

2011.09.21