Stack Overflow
Stack Overflow

Questions tagged [avl-tree]

Named after its inventors, Adelson-Velskii and Landis, an AVL tree is a self-balancing binary search tree.

Named after its inventors, Adelson-Velskii and Landis, an AVL tree is a self-balancing binary search tree. They were the first dynamically balanced trees to be proposed.

Like red-black trees, they are not perfectly balanced, but pairs of sub-trees differ in height by at most 1, maintaining an O(logn) search time.

842 questions
11
votes
2 answers

Custom index comparator in MongoDB

I'm working with a dataset composed by probabilistic encrypted elements indistinguishable from random samples. This way, sequential encryptions of the same number results in different ciphertexts. However, these still comparable through a special…
Pedro Alves
  • 1,539
  • 4
  • 16
  • 33
11
votes
2 answers

What is the standard binary search tree structure to use in Scala?

What is the standard balanced binary search tree implementation one should use in Scala 2.10.x? I am looking around and it seems that AVLTree was removed and RedBlack is deprecated with a message (Since version 2.10.0) use TreeMap or TreeSet…
jbx
  • 18,832
  • 14
  • 73
  • 129
10
votes
3 answers

Why is avl tree faster for searching than red black tree?

I have read it in a couple of places that avl tree search faster, but not able to understand. As I understand : max height of red-black tree = 2*log(N+1) height of AVL tree = 1.44*logo(N+1) Is it because AVL is shorter?
paseena
  • 3,889
  • 6
  • 29
  • 50
10
votes
5 answers

How to check if my AVL tree implementation is correct?

guys. I think I've created an AVL tree implementation, but as AVL Tree is quite a complex structure, I need to test it. So the question is - how can I test it? Have you got any ideas? Up to this moment I have the following tests: basic sanity check…
Graf
  • 1,307
  • 3
  • 16
  • 26
10
votes
3 answers

Is kd-tree always balanced?

I have used kd-tree algoritham and make tree. But i found that tree is not balanced so my question is if we used kd-tree algoritham then that tree is always balanced if not then how can we make it balance ?. We can use another algoritham likes…
Logicbomb
  • 527
  • 1
  • 6
  • 20
10
votes
2 answers

Handling duplicates keys within an AVL tree

I want to make my avl-tree support duplicate keys but there is a problem with the default behavior of the binary search tree with duplicates that the rotation could make nodes with equal key be on the left and the right of the parent. For example…
Ahmed Kotb
  • 6,019
  • 5
  • 31
  • 52
10
votes
4 answers

How is Wikipedia's example of an unbalanced AVL tree really unbalanced?

The image above is from "Wikipedia's entry on AVL trees" which Wikipedia indicates is unbalanced. How is this tree not balanced already? Here's a quote from the article: The balance factor of a node is the height of its right subtree minus the…
somas1
  • 1,080
  • 1
  • 16
  • 23
9
votes
3 answers

.NET Built-in AVL-Tree?

Is there a built in AVL Tree in the .NET libraries? I searched but didn't find any. If there is, then where? what namespace? If not, is there any good implementation for AVL Trees in C#? If also not! then is there an easy way to get it done? I know…
Tamer Shlash
  • 8,675
  • 4
  • 41
  • 74
9
votes
2 answers

Find the minimum gap between two numbers in an AVL tree

I have a data structures homework, that in addition to the regular AVL tree functions, I have to add a function that returns the minimum gap between any two numbers in the AVL tree (the nodes in the AVL actually represent numbers.) Lets say we have…
TheNotMe
  • 1,018
  • 2
  • 16
  • 32
8
votes
2 answers

Dynamic order statistic: get k-th element in constant time?

So, I'm trying to implement a Data Structure to handle Dynamic Order Statistic. The Data Structure has following operations: add(x): inserts a new element with value x get(k): returns the k-th smallest element: k = ceiling(n/a), where n = amount of…
G.M
  • 414
  • 3
  • 12
8
votes
1 answer

Why Red Black trees preferred over AVL trees for memory management in Linux?

The vm_area_struct structure used to link various sections of a memory mapped executable file is stored as a red black tree. Now, as far as I know and the post here mentions too Difference between red-black trees and AVL trees AVL trees performs…
rango
  • 301
  • 1
  • 11
8
votes
2 answers

AVL tree balance

I have implemented an AVL tree, but I have a problem. Suppose I have following tree: And after adding another node: Now I must rotate node5 to left: But after rotation, it is still unbalanced. Where am I making a mistake?
MRB
  • 3,617
  • 3
  • 29
  • 40
8
votes
3 answers

Perfect Balanced Binary Search Tree

I have an theoretical question about Balanced BST. I would like to build Perfect Balanced Tree that has 2^k - 1 nodes, from a regular unbalanced BST. The easiest solution I can think of is to use a sorted Array/Linked list and recursively divide the…
OlejkaKL
  • 521
  • 1
  • 9
  • 23
7
votes
7 answers

Minimum number of node in AVL tree?

I know the formula of finding minimum number of node in a AVL tree is S(h) = S(h-1) + S(h-2) + 1 However, I don't really get how to use this function, say if we have a AVL height of 6. The answer tells me that Minimum = 7 + 4 + 1 =12. But how do…
user2913922
  • 129
  • 1
  • 1
  • 8
7
votes
4 answers

Binary search tree over AVL tree

As far as I know the time complexity between AVL trees and Binary Search Trees are the same in average case, with AVLs beating BSTs in worst case scenarios. This gives me a hint that AVLs are always superior than BSTs in every possible way to…
Theocharis K.
  • 1,221
  • 1
  • 15
  • 41
1
2
3
…
56 57