8000 修改AVL树。 · ssjssh/javaalgorithm@382122f · GitHub
[go: up one dir, main page]

Skip to content

Commit 382122f

Browse files
author
shengshijun
committed
修改AVL树。
1 parent 7fefc21 commit 382122f

File tree

1 file changed

+6
-11
lines changed

1 file changed

+6
-11
lines changed

src/main/java/ssj/algorithm/collections/AVLTree.java

Lines changed: 6 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@ public AVLTree() {
2424
/**
2525
* 使用一个排好序的列表来创建AVL树
2626
*
27-
* @param arr
27+
* @param arr 排好序的数组
2828
*/
2929
public AVLTree(T[] arr) {
3030
Preconditions.checkNotNull(arr);
@@ -243,6 +243,7 @@ private boolean getNodePathCore(Node start, T ele, Stack<Node> path_stack) {
243243
}
244244

245245

246+
@SuppressWarnings("unused")
246247
private Vector<LinkedList<Node>> createLevelLinkedList() {
247248
Vector<LinkedList<Node>> result = new Vector<>();
248249
LinkedList<Node> current = new LinkedList<>();
@@ -275,7 +276,7 @@ private Vector<LinkedList<Node>> createLevelLinkedList() {
275276
* @param tree
276277
* @return
277278
*/
278-
public boolean isSubTree(AVLTree tree) {
279+
public boolean isSubTree(AVLTree<T> tree) {
279280
Preconditions.checkNotNull(tree);
280281
if (_head.getValue() == null && tree._head.getValue() == null) {
281282
return true;
@@ -400,7 +401,7 @@ public Iterator<T> postIterator() {
400401
* 2,左子树不存在,那么直接把右子树移动到父节点位置
401402
* 3,左右子树都存在,那么取出后继节点,后继节点肯定满足上面的1,2种条件。
402403
*
403-
* @param ele
404+
* @param ele 要删除的元素
404405
*/
405406
@Override
406407
public void delete(T ele) {
@@ -654,12 +655,6 @@ public String toString() {
654655
final StringBuilder sb = new StringBuilder("Node{");
655656
sb.append("height=").append(height);
656657
sb.append(", value=").append(value);
657-
// if (left != null) {
658-
// sb.append(",\n\t left=").append(left);
659-
// }
660-
// if (right != null) {
661-
// sb.append(",\n\t right=").append(right);
662-
// }
663658
sb.append('}');
664659
return sb.toString();
665660
}
@@ -669,12 +664,12 @@ public boolean equals(Object o) {
669664
if (this == o) return true;
670665
if (o == null || getClass() != o.getClass()) return false;
671666

667+
@SuppressWarnings("unchecked")
672668
Node node = (Node) o;
673669

674670
if (height != node.height) return false;
675-
if (!value.equals(node.value)) return false;
671+
return value.equals(node.value);
676672

677-
return true;
678673
}
679674

680675
@Override

0 commit comments

Comments
 (0)
0