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

Algorithm, what algorithms can i use for the above title in my project desi... what algorithms can i use for the above title in my project desing and implmentation of road transport booking system

Calculate address of an element in an array., Q. Explain the technique to c... Q. Explain the technique to calculate the address of an element in an array. A  25 × 4  matrix array DATA is stored in memory in 'row-major order'. If base  address is 200 and

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

Applications of avl trees, AVL trees are applied into the given situations:... AVL trees are applied into the given situations: There are few insertion & deletion operations Short search time is required Input data is sorted or nearly sorted

Rules for abstract data type-tree, null(nil) = true                     // ... null(nil) = true                     // nil refer for empty tree null(fork(e, T, T'))= false   //  e : element , T and T are two sub tree leaf(fork(e, nil, nil)) = true leaf(

Define the term - array, Define the term - Array A fixed length, ord... Define the term - Array A fixed length, ordered collection of values of same type stored in contiguous memory locations; collection may be ordered in several dimensions.

Merging, merging 4 sorted files containing 50 10 25 and 15 records will tak... merging 4 sorted files containing 50 10 25 and 15 records will take time

Method to add an element in circular queue, Q. Let us consider a queue is h... Q. Let us consider a queue is housed in an array in circular fashion or trend. It is required to add new items to the queue. Write down a method ENQ to achieve this also check whet

Program on radix sort., Write a program that uses the radix sort to sort 10... Write a program that uses the radix sort to sort 1000 random digits. Print the data before and after the sort. Each sort bucket should be a linked list. At the end of the sort, the

Find longest repeat prefix of string - linear time algorithm, 1. A string s... 1. A string s is said to be periodic with a period α, if s is α k for some k > 2. (Note that α k is the string formed by concatenating k times.) A DNA sequence s is called a tand