This week's book giveaway is in the General Computing forum.
We're giving away four copies of Emmy in the Key of Code and have Aimee Lucido on-line!
See this thread for details.
Win a copy of Emmy in the Key of Code this week in the General Computing forum!
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Liutauras Vilda
  • Junilu Lacar
  • Jeanne Boyarsky
  • Bear Bibeault
Sheriffs:
  • Knute Snortum
  • Devaka Cooray
  • Tim Cooke
Saloon Keepers:
  • Tim Moores
  • Stephan van Hulst
  • Tim Holloway
  • Ron McLeod
  • Carey Brown
Bartenders:
  • Paweł Baczyński
  • Piet Souris
  • Vijitha Kumara

Where are AVL tree data structures used?

 
Greenhorn
Posts: 4
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Where are AVL tree data structures used ? is it covered in the book ?
 
Author
Posts: 75
5
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator

AVL trees belong to unique type of binary search trees.In AVL trees,difference of height of left subtree and right subtree of every node is nearly one.They are called as self-balancing binary search trees.
 
Greenhorn
Posts: 24
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
(1)AVL tree is a self-balancing binary search tree.
(2)In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property.
(3)The technique of balancing the height of binary trees was developed by Adelson, Velskii, and Landi and hence given the short form as AVL tree or Balanced Binary Tree.
(4)AVL tree is efficient when your job have more searching than insertion.
(5)Thus,AVL tree is a binary search tree in which the difference of heights of left and right subtrees of any node is less than or equal to one.

AVL trees
are beneficial in the cases where you are designing some database where insertions and deletions are not that frequent but you have to frequently look-up for the items present in there.

AVL trees are applied in th e following situations:
  • There are few insertion and deletion operations
  • Short search time is needed
  • Input data is sorted or nearly sorted


  •  
    You totally ruined the moon. You're gonna hafta pay for that you know. This tiny ad agrees:
    Java file APIs (DOC, XLS, PDF, and many more)
    https://products.aspose.com/total/java
    • Post Reply Bookmark Topic Watch Topic
    • New Topic
    Boost this thread!