avl-tree

问题 The third paragraph of wikipedia's article on AVL trees says: "Because AVL trees are more rigidly balanced, they are faster than red-black trees for lookup-intensive applications." So, shouldn't TreeMap be implemented using AVL trees instead of red-black trees(as there will be more look up intensive applictions for a hashing based data structure ) ? 回答1: Red-Black trees are more general purpose. They do relatively well on add, remove, and look-up but AVL trees have faster look-ups at the cost

问题 I'm not sure if I'm doing this correctly as this is my very first time coding with nodes. But here's my code so far, if someone can look over it and help me out with understanding if I'm doing anything wrong. Also my insert/remove methods are giving me a hard time. The professor gave us the pseudocode for that but I can't seem to grasp how to interpret it into Java code as I've never done this type of code before. Mostly because there's a if statement that checks the heights to see if the

问题 So I'm given an AVL tree. And im trying to figure out at least the pseudocode to find the key with the minimum data values among all of the keys between two values k1 and k2. This is assuming that the field data stored in each node is an integer. I want to make sure that my pseudocode runs in O(logn) time. I know that I can do it by storing an extra field in the node structure..and showing how this field can be maintained during updates, but I don't know where to go from there. 回答1: Let's

问题 I am working on an assignment that asks me to implement an AVL tree. I'm pretty sure I have the rotation methods correct, but I'm having trouble figuring out when to use them. For example, the explanation in the book says that I should climb up the same path I went down to insert the node/element. However, I can't have any parent pointers. Latest code: public BinaryNode<T> insert(BinaryNode<T> node) { if (this.getElement().compareTo(node.getElement()) > 0) { if (this.getLeftChild() != null) {

问题 It is well known that deletion from an AVL tree may cause several nodes to eventually be unbalanced. My question is, what is the minimum sized AVL tree such that 2 rotations are required (I'm assuming a left-right or right-left rotation is 1 rotation)? I currently have an AVL tree with 12 nodes where deletion would cause 2 rotations. My AVL tree is inserting in this order: 8, 5, 9, 3, 6, 11, 2, 4, 7, 10, 12, 1. If you delete the 10, 9 becomes unbalanced and a rotation occurs. In doing so, 8

问题 I'm having the hardest time trying to figure out how to balance an AVL tree for my class. I've got it inserting with this: Node* Tree::insert(int d) { cout << "base insert\t" << d << endl; if (head == NULL) return (head = new Node(d)); else return insert(head, d); } Node* Tree::insert(Node*& current, int d) { cout << "insert\t" << d << endl; if (current == NULL) current = new Node(d); else if (d < current->data) { insert(current->lchild, d); if (height(current->lchild) - height(current-

问题 Hello I am writing an avl tree and I have one issue . I am currently having a root as global since I use it in the class as well as in main , how can I write it without having it global? struct avl_node { int data; struct avl_node *left; struct avl_node *right; }*root; class avlTree { public: int height(avl_node *temp) { int h = 0; if (temp != NULL) { int l_height = height (temp->left); int r_height = height (temp->right); int max_height = max (l_height, r_height); h = max_height + 1; }

问题 I am trying to implement an AVL Tree following the guidelines from here. I been having some issues getting this to work. Currently I am getting this error in the "Right Right Case" of insert. Specifically at this line: // Right Right Case if (balance < -1 && theData > root->right->data) leftRotate(root); The error I get is: Exception thrown: read access violation. root._Mypair._Myval2->right._Mypair._Myval2 was nullptr. I would really appreciate if someone could help me fix this. Here is my

问题 I'm struggling a little to come up with a notion of membership proof for Data.AVL trees. I would like to be able to pass around a value of type n ∈ m , to mean that n appears as a key in in the AVL tree, so that given such a proof, get n m can always successfully yield a value associated with n. You can assume my AVL trees always contain values drawn from a join semilattice (A, ∨, ⊥) over a setoid (A, ≈), although below the idempotence is left implicit. module Temp where open import Algebra

问题 I want to implement the Java AVL tree and to rotate the tree left and right. I am not getting this. Can anybody by looking at the code below tell me how can I possibly rotate the tree left and right and then use fix up with those two functions to balance the AVL tree? I hope someone here can guide me through this. import java.util.Random; import java.util.SortedSet; import java.util.TreeSet; public class AVLTree<T> extends BinarySearchTree<AVLTree.Node<T>, T> implements SSet<T> { Random rand;