数据结构—二叉排序树（Java）
<!-- more -->
博客阐明
文章所波及的材料来自互联网整顿和集体总结，意在于集体学习和教训汇总，如有什么中央侵权，请分割自己删除，谢谢！
阐明
二叉排序树：BST: (Binary Sort(Search) Tree), 对于二叉排序树的任何一个非叶子节点，要求左子节点的值比以后节点的值小，右子节点的值比以后节点的值大
代码
package cn.guizimo.binarysorttree;public class BinarySortTree { public static void main(String[] args) { int[] arr = {7, 3, 10, 12, 5, 1, 9, 2}; BinarySortTreeDemo binarySortTree = new BinarySortTreeDemo(); for(int i = 0; i< arr.length; i++) { binarySortTree.add(new Node(arr[i])); } System.out.println("中序遍历"); binarySortTree.infixOrder(); // 1, 3, 5, 7, 9, 10, 12 binarySortTree.delNode(12); System.out.println("以后根节点root=" + binarySortTree.getRoot()); System.out.println("删除后中序遍历"); binarySortTree.infixOrder(); } }class BinarySortTreeDemo { private Node root; public Node getRoot() { return root; } //查找以后节点 public Node search(int value) { if (root == null) { return null; } else { return root.search(value); } } //找到最小值 public int delRightTreeMin(Node node) { Node target = node; while(target.left != null) { target = target.left; } delNode(target.value); return target.value; } //删除节点 public void delNode(int value) { if (root == null) { return; } else { //删除叶子节点 Node targetNode = search(value); if (targetNode == null) { return; } if (root.left == null && root.right == null) { root = null; return; } Node parent = searchParent(value); if (targetNode.left == null && targetNode.right == null) { if (parent.left != null && parent.left.value == value) { parent.left = null; } else if (parent.right != null && parent.right.value == value) { parent.right = null; } //删除两颗子树的节点 } else if (targetNode.left != null && targetNode.right != null) { int i = delRightTreeMin(targetNode.right); targetNode.value = i; //删除一颗子树的节点 } else { if (targetNode.left != null) { if (parent != null) { if (parent.left.value == value) { parent.left = targetNode.left; } else { parent.right = targetNode.right; } } else { root = targetNode.left; } } else { if (parent != null) { if (parent.left.value == value) { parent.left = targetNode.right; } else if (parent.right.value == value) { parent.right = targetNode.right; } } else { root = targetNode.right; } } } } } //查问以后节点的父节点 public Node searchParent(int value) { if (root == null) { return null; } else { return root.searchParent(value); } } //增加节点 public void add(Node node) { if (root == null) { root = node; } else { root.add(node); } } //中序遍历 public void infixOrder() { if (root != null) { root.infixOrder(); } else { System.out.println(""); } }}class Node { int value; Node left; Node right; public Node(int value) { this.value = value; } @Override public String toString() { return "Node{" + "value=" + value + '}'; } //查找节点 public Node search(int value) { if (value == this.value) { return this; } else if (value < this.value) { if (this.left == null) { return null; } return this.left.search(value); } else { if (this.right == null) { return null; } return this.right.search(value); } } //查问父节点 public Node searchParent(int value) { if ((this.left != null && this.left.value == value) || (this.right != null && this.right.value == value)) { return this; } else { if (value < this.value && this.left != null) { return this.left.searchParent(value); } else if (value >= this.value && this.right != null) { return this.right.searchParent(value); } else { return null; } } } //增加节点 public void add(Node node) { if (node == null) { return; } if (node.value < this.value) { if (this.left == null) { this.left = node; } else { this.left.add(node); } } else { if (this.right == null) { this.right = node; } else { this.right.add(node); } } } //中序遍历 public void infixOrder() { if (this.left != null) { this.left.infixOrder(); } System.out.println(this); if (this.right != null) { this.right.infixOrder(); } }}测试
感激
尚硅谷以及勤奋的本人