《二叉树的java实现.doc》由会员分享，可在线阅读，更多相关《二叉树的java实现.doc（10页珍藏版）》请在金锄头文库上搜索。
1、JAVA1./* * * param tree */public BinaryTree(Object tree)this.data = data;left = right = null;2./* * param data * param tree */public BinaryTree(Object data , BinaryTree tree)this.data = data;this.left = left;this.right = right;3.1/* * - * * param root */public void preOrder(BinaryTree root)if(root =
2、 null)return ;elseSystem.out.println(root.data+);preOrder(root.left);preOrder(root.right);2/* * - * param root */public void inOrder(BinaryTree root)if(root = null)return;elseinOrder(root.left);System.out.println(root.data+);inOrder(root.right);3/* * - * param root */public void postOrder(BinaryTree
3、 root)if(root = null)return;elsepostOrder(root.left);postOrder(root.right);System.out.println(root.data + );4/* * * param root */public void layoutOrder(BinaryTree root) elements0 = root;front = 0;rear = 1;while (front rear) try if (elementsfront != null) System.out.println(elementsfront.data + );if
4、 (elementsfront.left != null) elementsrear+ = elementsfront.left;if (elementsfront.right != null) elementsrear+ = elementsfront.right;front+; catch (Exception e) e.printStackTrace();4/* * +1, * * return */public int leaves() if (this = null)return 0;if (left = null & right = null) return 1; else ret
5、urn (left = null ? 0 : left.leaves()+ (right = null ? 0 : right.leaves();5./* * return */public int height()int heightOfTree;if(this = null)return -1;int leftHeight = (left = null ? 0 : left.height();int rightHeight = (right = null ? 0 : right.height();heightOfTree = leftHeight rightHeight ? rightHe
6、ight : leftHeight ;return 1+ heightOfTree ;6.public int level(Object object) int levelInTree;if (this = null)return -1;if (object = data)return 1;/ int leftLevel = (left = null ? -1 : left.level(object);int rightLevel = (right = null ? -1 : right.level(object);if (leftLevel 0 & rightLevel 0)return -
7、1;levelInTree = leftLevel rightLevel ? rightLevel : leftLevel;return 1 + levelInTree;7.public void reflect()if(this = null)return ;if(left != null)left.reflect();if(right != null)right.reflect();BinaryTree temp = left;left = right;right = temp;8./* * */public void defoliate()if(this = null)return ;i
8、f(left = null & right = null)System.out.println(this + );data = null;return;if(left != null)left.defoliate();left = null;data = null;if(right != null)right.defoliate();right = null;=package arithmetic;/* JAVA 1. 2.* author */public class BinaryTree public final static int MAX = 40;BinaryTree element
9、s = new BinaryTree40; / int front; / int rear; / private Object data; / private BinaryTree left, right; / /* * * * param tree */public BinaryTree(Object data) this.data = data;left = right = null;/* * * * param data * param tree */public BinaryTree(Object data, BinaryTree left, BinaryTree right) this.data = data;this.left = left;this.right = right;/* * toString */public String toString() return data.toString();/* * - * * param root */public void preOrder(BinaryTree root) if (root = null) return; else System.out.print(root.data + );preOrder(root.left);preOrder(r
