When We Have Redblack Trees And Avl Trees That Can Perform Most #677
When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?
This multiple choice question (MCQ) is related to the book/course
gs gs121 Data Structures and Algorithms.
It can also be found in
gs gs121 Binary Trees - Splay Tree - Quiz No.1.
When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?
no there is no special usage
In real time it is estimated that 80% access is only to 20% data, hence most used ones must be easily available
redblack and avl are not upto mark
they are just another type of self balancing binary search trees
Similar question(s) are as followings:
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
