1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178
| package com;
public class BinaryTree<Key extends Comparable<Key>, Value> {
public Node root; public int BinaryTreeLength;
private class Node { public Key key; public Value value; public Node left; public Node right;
public Node(Key key, Value value, Node left, Node right) { this.key = key; this.value = value; this.left = left; this.right = right; } }
public int size() { return BinaryTreeLength; }
public void put(Key key, Value value) { root = put(key, value, root); }
private Node put(Key key, Value value, Node node) { if (node==null) { BinaryTreeLength++; return new Node(key, value, null, null); } int cmp = key.compareTo(node.key); if (cmp < 0) { node.left = put(key, value, node.left); } else if (cmp > 0) { node.right = put(key, value, node.right); } else { node.value = value; } return node; }
public Value get(Key key) { return get(key, root); }
public Value get(Key key, Node node) { if (node==null) { return null; } Value value = null; int cmp = key.compareTo(node.key); if (cmp < 0) { return get(key, node.left); } else if (cmp > 0) { return get(key, node.right); } else { return node.value; }
}
public void delete(Key key) { delete(key, root); }
private Node delete(Key key, Node node) { if (node==null) { return null; } int cmp = key.compareTo(node.key); if (cmp < 0) { delete(key, node.left); } else if (cmp > 0) { delete(key, node.right); } else {
BinaryTreeLength--;
if (node.left==null) { return node.right; } if (node.right==null) { return node.left; } Node minNode = node.right; while (minNode.left!=null) { minNode = minNode.left; } Node n = node.right; while (n.left!=null) { if (n.left.left==null) { n.left = null; } else { n = n.left; } } minNode.left = node.left; minNode.right = node.right; node = minNode; } return node; }
}
|