What Is The Disadvantage Of Bst Over The Hash Table #1091
What is the disadvantage of BST over the hash table?
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 Hash Tables - Hash Tables Chaining with Binary Trees - Quiz No.1.
What is the disadvantage of BST over the hash table?
BST is easier to implement
BST can get the keys sorted by just performing inorder traversal
BST can perform range query easily
Time complexity of hash table in inserting, searching and deleting is less than that of BST
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
