1. In computer science, a classic problem is how to dynamically store information so as to let for quick look up. This searching problem arises frequently in dictionaries, symbol tables for compilers, telephone directory and while storing business records etc. The records are stored into a balanced binary tree, depend on the keys (numerical or alphabetical) order. The balanced nature of the tree limits its height to O (log n), where n is the number of added records.

2. AVL trees are extremely fast on searches & replacements. However, have a moderately high cost for insertion and deletion. If application does a lot more searches and replacements than it does addition & deletions, the balanced (AVL) binary tree is a good option for a data structure.

3. AVL tree also contain applications in file systems.

Posted Date: 4/11/2013 3:27:00 AM | Location : United States

Ask an Expert

Related Discussions:- Applications in file systems of avl trees, Assignment Help, Ask Question on Applications in file systems of avl trees, Get Answer, Expert's Help, Applications in file systems of avl trees Discussions

Write discussion on Applications in file systems of avl trees
Your posts are moderated

Write your message here..

Related Questions

Advantages of dry running a flowchart, Advantages of dry running a flowchar... Advantages of dry running a flowchart When dry running a flowchart it's advisable to draw up a trace table illustrating how variables change their values at every stage in the

Calculus, basic calculation for algorith. basic calculation for algorith.

Compound interest, Write the algorithm for compound interest Write the algorithm for compound interest

Draw trace table and determine output of number, Draw trace table and deter... Draw trace table and determine output from the following flowchart using following data: Number = 45, -2, 20.5

Explain linked list, Linked List  A linked list is a linear collection... Linked List  A linked list is a linear collection of data elements called nodes. The linear order is given by pointer. Every node is divided into 2 or more parts.

Algorithmss, calculate gpa using an algorithm calculate gpa using an algorithm

Tape sort based on fibonacci distribution, how does we get fibonacci table ... how does we get fibonacci table in tape sort

Explain in detail about the ruby arrays, Explain in detail about the Ruby a... Explain in detail about the Ruby arrays Ruby arrays have many interesting and powerful methods. Besides indexing operations which go well beyond those discussed above, arrays h

Explain the term heuristics searching, (a) Discuss the role played by Busin... (a) Discuss the role played by Business Intelligence Systems in giving companies strategic advantage. (b) Explain the term heuristics searching . (c) With the use of an appr

ALGORITHMS, WRITE AN ALGORITHM TO READ TWO NUMBERS AND PRINT THE LOWER VALU... WRITE AN ALGORITHM TO READ TWO NUMBERS AND PRINT THE LOWER VALUE