二叉树可视化Java语言实现(完整版,打开即可运行).docVIP

一、public class BinaryNodeE { private E element; private BinaryNodeE left; private BinaryNodeE right; public E getElement() { return element; } public void setElement(E element) { this.element = element; } public BinaryNodeE getLeft() { return left; } public void setLeft(BinaryNodeE left) { this.left = left; } public BinaryNodeE getRight() { return right; } public void setRight(BinaryNodeE right) { this.right = right; } // 递归方法构造tree，单个输出： public static void structPrint(BinaryNodeInteger e) { if (e.element 12) return; else { // System.out.print(( + e.element + )); BinaryNodeInteger left = new BinaryNodeInteger(); left.setElement(e.element * 2 + 1); BinaryNodeInteger right = new BinaryNodeInteger(); right.setElement(e.element * 2 + 2); // System.out.print( ); // System.out.print(( + e.element + )); // System.out.print([+left.getElement()+ +right.getElement()+]); if (left.getElement() 12) return; else { e.setLeft(left); e.setRight(right); structPrint(left); structPrint(right); } } } // 递归前序遍历 public static void inorder(BinaryNodeInteger root) { if (root != null) { // System.out.print(root.getElement());//调整位置得到中、后序。 inorder(root.getLeft()); // System.out.print(root.getElement()); inorder(root.getRight()); System.out.print(( + root.element + )); } } // 查找叶子（前序） public static BinaryNodeInteger search(BinaryNodeInteger root, int e) { if (root != null) { if (root.getElement() == e) { // System.out.print(* + root.element + *); return root; } else { search(root.getLeft(), e); search(root.getRight(), e); } } return root; } public static void test(BinaryNodeInteger root, int e) { BinaryNodeInteger parent = new BinaryNodeInteger(); int i1 = (e - 2) / 2; parent = BinaryNode.search(root, i1); System.out.println(*~!! + BinaryNode.search(root, i1).getElement() + !!*); } // 删除节点（前序）： public static void delete(BinaryNode