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

Hash function, Q. Define the graph, adjacency matrix, adjacency list, hash ... Q. Define the graph, adjacency matrix, adjacency list, hash function, adjacency matrix, sparse matrix, reachability matrix.

Steps of pre-order traversal, Pre-order Traversal The method of doing a... Pre-order Traversal The method of doing a pre-order traversal iteratively then has the several steps(suppose that a stack is available to hold pointers to the appropriate nodes

In-order traversal, Write steps for algorithm for In-order Traversal Th... Write steps for algorithm for In-order Traversal This process when implemented iteratively also needs a stack and a Boolean to prevent the execution from traversing any portion

Explain arrays, Arrays :- To execute a stack we need a variable called top,... Arrays :- To execute a stack we need a variable called top, that holds the index of the top element of stack and an array to hold the part of the stack.

Dijkstra's algorithm, Q. Explain Dijkstra's algorithm for finding the short... Q. Explain Dijkstra's algorithm for finding the shortest path in the graph given to us.  Ans: The Dijkstra's algorithm: This is a problem which is concerned with finding

What are the dynamic arrays, What are the Dynamic arrays Dynamic arrays... What are the Dynamic arrays Dynamic arrays are convenient for programmers since they can never be too small-whenever more space is needed in a dynamic array, it can simply be e

Analyze an algorithm, In order to analyze an algorithm is to find out the a... In order to analyze an algorithm is to find out the amount of resources (like time & storage) that are utilized to execute. Mostly algorithms are designed to work along with inputs

Fifo, give any example of page replacement using fifo and use your own refe... give any example of page replacement using fifo and use your own reference string

Euclidean algorithm, The Euclidean algorithm is an algorithm to decide the ... The Euclidean algorithm is an algorithm to decide the greatest common divisor of two positive integers. The greatest common divisor of N and M, in short GCD(M,N), is the largest in

Doubly linklist, explanation of doubly linklist explanation of doubly linklist