二叉树功能的完整版

此功能包括了二叉树的： 查找 ，删除， 修改， 遍历， 找最大值最小值 ，插入（建立）

前提： 二叉树是在搜索二叉树基础上的.

主要包含了三个java ： 第一个是main 测试类， 第二个是 node 结点类 ，第三个是tree 树类（包含了所有的操作）

package Tree; public class MainTest { public static void main(String[] args) { Tree tree = new Tree(); Node node = new Node(); Node node1 = new Node(); Node node2 = new Node(); Node node3 = new Node(); Node node4 = new Node(); node.setId(5); tree.insert(node); node1.setId(3); tree.insert(node1); node2.setId(6); tree.insert(node2); node3.setId(1); tree.insert(node3); node4.setId(4); tree.insert(node4); Node node5 = new Node(); tree.update(node5 , 10); tree.delete(node1); System.out.println( tree.find(node3)); System.out.println( tree.findSmallest().getId()) ; System.out.println( tree.findBiggest().getId()) ; } }  

 

 

package Tree; public class Node { private int id ; private Node l_child ; private Node r_child ; private boolean isDeleted = false; //check isDeleted public boolean isDeleted() { return isDeleted; } public void setDeleted(boolean isDeleted) { this.isDeleted = isDeleted; } public Node getL_child() { return l_child; } public void setL_child(Node lChild) { l_child = lChild; } public Node getR_child() { return r_child; } public void setR_child(Node rChild) { r_child = rChild; } public int getId() { return id; } public void setId(int id) { this.id = id; } }  

package Tree; public class Tree { private Node root ; /* * find */ public boolean find(Node node) { if (root == null || node.isDeleted() == true) return false ; Node curr = root ; int id = curr.getId() ; int key = node.getId(); // 写法 ： 1 while (id!= key) { if (id > key) { curr = curr.getL_child(); } if (id < key) { curr = curr.getR_child(); } if (curr == null) { return false; } id = curr.getId(); } // 写法 ： 2 while (curr !=null) { if (id > key) { curr = curr.getL_child(); } if (id < key) { curr = curr.getR_child(); } if (id == key) { return true; } id = curr.getId(); } return true; } /* * insert */ public void insert(Node node) { boolean isInsert = false ; if (root == null) { root = node ; } else { Node parent = root; Node curr = root; int key = node.getId() ; while (isInsert == false) { int id = curr.getId() ; parent = curr; //go left if (id > key) { curr = curr.getL_child(); if (curr == null) { parent.setL_child(node); isInsert = true ; } } //go right else { curr = curr.getR_child() ; if (curr == null) { parent.setR_child(node); isInsert = true ; } } } } } /* * delete */ public void delete(Node node) { node.setDeleted(true); } /* * find all middle order */ public void findAll(Node node) { if (node != null) { findAll(node.getL_child()); System.out.print(node.getId()); findAll(node.getR_child()); } } /* * update */ public void update(Node node ,int id) { if (node == null) { return; } if (find(node)) { node.setId(id); System.out.println("update ok"); } } /* * find the smallest * */ public Node findSmallest() { Node curr = root; Node small = null; while (curr !=null) { small = curr ; curr = curr.getL_child(); } return small ; } /* * find the biggest */ public Node findBiggest() { Node curr = root; Node big = null; while (curr !=null) { big = curr ; curr = curr.getR_child(); } return big ; } }