Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Advantages of AVL Trees

    Uploaded by

    durvasikiran
    A data structure is a way of organizing data in computer memory. An abstract data type (ADT) specifies a set of data and operations that can be performed on that data, such as associative arrays, sets, stacks, queues, and trees. AVL trees provide efficient search, insertion, and deletion operations that are all O(log N) by keeping the tree balanced through rebalancing. While AVL trees have faster asymptotic performance than some alternatives, the rebalancing operations take time and they are more difficult to program than other balanced tree structures.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Advantages of AVL Trees

    Uploaded by

    durvasikiran
    29 views1 page
    A data structure is a way of organizing data in computer memory. An abstract data type (ADT) specifies a set of data and operations that can be performed on that data, such as associative arrays, sets, stacks, queues, and trees. AVL trees provide efficient search, insertion, and deletion operations that are all O(log N) by keeping the tree balanced through rebalancing. While AVL trees have faster asymptotic performance than some alternatives, the rebalancing operations take time and they are more difficult to program than other balanced tree structures.

    Original Title

    ads notes.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    A data structure is a way of organizing data in computer memory. An abstract data type (ADT) specifies a set of data and operations that can be performed on that data, such as associative arrays, sets, stacks, queues, and trees. AVL trees provide efficient search, insertion, and deletion operations that are all O(log N) by keeping the tree balanced through rebalancing. While AVL trees have faster asymptotic performance than some alternatives, the rebalancing operations take time and they are more difficult to program than other balanced tree structures.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    29 views1 page

    Advantages of AVL Trees

    Uploaded by

    durvasikiran
    A data structure is a way of organizing data in computer memory. An abstract data type (ADT) specifies a set of data and operations that can be performed on that data, such as associative arrays, sets, stacks, queues, and trees. AVL trees provide efficient search, insertion, and deletion operations that are all O(log N) by keeping the tree balanced through rebalancing. While AVL trees have faster asymptotic performance than some alternatives, the rebalancing operations take time and they are more difficult to program than other balanced tree structures.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 1

    What is a data structure?

    A data structure is a way of organizing data in the computer memory.


    What is ADT?
    Abstract data type(ADT) is a specification of a set of data and the set of operations that can be
    performed on the data.
    Example:
    associative array
    set
    stack
    queue
    tree
    Uses of AD:
    1. It helps to efficiently develop well designed program
    2. facilitaties the decomposition of the complext tast of developing a software system into a number
    of simpler subtasks.
    Advantages of AVL trees:
    1. Search is O(log N) since AVL trees are always balanced.
    2. Insertion and deletions are also O(logn)
    3. The height balancing adds no more than a constant factor to
    the speed of insertion
    disadvantages of AVL trees:
    1. Difficult to program & debug; more space for balance factor.
    2. Asymptotically faster but rebalancing costs time.
    3. Most large searches are done in database systems on disk
    and use other structures (e.g. B-trees).
    4. May be OK to have O(N) for a single operation if total run
    time for many consecutive operations is fast (e.g. Splay trees).

    You might also like