solved Task 4
This commit is contained in:
@@ -12,8 +12,9 @@ public class AVLSearchTree<T extends Comparable<T>> extends SortedBinaryTree<T>
|
|||||||
|| (node.right != null && !balanced(node.right))
|
|| (node.right != null && !balanced(node.right))
|
||||||
|| (node.left != null && !balanced(node.left))){
|
|| (node.left != null && !balanced(node.left))){
|
||||||
return false;
|
return false;
|
||||||
|
} else {
|
||||||
|
return true;
|
||||||
}
|
}
|
||||||
return true;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
public boolean balanced() {
|
public boolean balanced() {
|
||||||
|
|||||||
Reference in New Issue
Block a user