Answered Questions

  • Oct 01 2010
    01:35 PM
    32231
    12

    Advantage of avl tree over binary search tree.
    • nipa123456

    What is advantage using avl tree instead of using binary search tree ?

    simran

    • Nov 23rd, 2016

    In BST, the time complexity of search operation (average case) is taken to be O(log n). But in the worst case, i.e the degenerate trees/skewed trees time complexity of search operation is O(n) which c...

    kirubasri

    • Sep 8th, 2015

    Better search times for keys