eclipse-java-workspace.rar_java常用算法集工作间打包

package Tree; import java.util.Scanner; public class Tree { Scanner sc = new Scanner(System.in);//使用Scanner来接收键盘输入的结点数据 //初始化二叉树的根 CBTType InitTree() { CBTType node = new CBTType(); System.out.println("请先输入根节点数据"); node.data = sc.next(); node.left = null; node.right = null; return node; } //添加结点 void AddTreeNode(CBTType node){ CBTType pnode = new CBTType(); CBTType parent = new CBTType(); String data; int menusel; System.out.println("输入二叉树几点数据："); pnode.data = sc.next(); pnode.left = null; pnode.right = null; System.out.println("请输入该结点的父节点数据"); data = sc.next(); parent = TreeFindNode(node,data); if(parent == null) { System.out.println("未找到该父结点"); pnode = null; return; } System.out.println("1.添加到该父节点的左子树"); System.out.println("2.添加到该父结点的右子树"); do { menusel = sc.nextInt(); if(menusel == 1 || menusel == 2 || menusel == 0) { switch(menusel){ case 0: return; case 1: if(parent.left != null) { System.out.println("左子树结点不为空"); }else { parent.left = pnode; } break; case 2: if(parent.right != null) { System.out.println("右子树结点不为空"); }else { parent.right = pnode; } break; default: System.out.println("无效参数，请重新输入"); } } }while(menusel != 1 && menusel != 2 && menusel != 0); } //查找结点 CBTType TreeFindNode(CBTType node,String data) { CBTType ptr; if(node == null) { return null; }else { if(node.data.equals(data)) { return node; }else { if((ptr = TreeFindNode(node.left,data)) != null) { return ptr; }else if((ptr = TreeFindNode(node.right,data)) != null) { return ptr; }else { return null; } } } } //获取左子树 CBTType TreeLeftNode(CBTType node) { if(node != null) { return node.left; }else { return null; } } //获取右子树 CBTType TreeRightNode(CBTType node) { if(node != null) { return node.right; }else { return null; } } //判断空树 boolean TreeIsEmpty(CBTType node) { if(node != null) { return false; }else { return true; } } //计算二叉树深度 int TreeDepth(CBTType node) { int depleft,depright; if(node == null) { return 0; }else { depleft = TreeDepth(node.left); depright = TreeDepth(node.right); if(depleft > depright) { return depleft + 1; }else { return depright + 1; } } } //清空二叉树 void ClearTree(CBTType node) { if(node != null) { ClearTree(node.left); ClearTree(node.right); node = null; } } //显示结点数据 void TreeNodeData(CBTType node) { System.out.println(node.data);//打印当前结点的数据 } //二叉树的遍历 //1.层序遍历 //2.先序遍历DLR，中序遍历LDR，后序遍历RDL //层序遍历 void LevelTree(CBTType node) { CBTType p; CBTType[] q = new CBTType[CBTType.MAXLEN];//定义一个顺序队列 int head = 0,tail = 0; if(node != null) { tail = (tail + 1)%CBTType.MAXLEN; q[tail] = node; }//将二叉树根引用进队 while(head != tail) { head = (head + 1)%CBTType.MAXLEN; p = q[head]; TreeNodeData(p); if(p.left != null) { tail = (tail + 1)%CBTType.MAXLEN; q[tail] = p.left; } if(p.right != null) { tail = (tail + 1)%CBTType.MAXLEN; q[tail] = p.right; } } } //先序遍历 void DLRTree(CBTType node) { TreeNodeData(node); DLRTree(node.left); DLRTree(node.right); } //中序遍历 void LDRTree(CBTType node) { LDRTree(node.left); TreeNodeData(node); LDRTree(node.right); } //后序遍历 void LRDTree(CBTType node) { LRDTree(node.left); LRDTree(node.right); TreeNodeData(node); } }