What Is The Worst Case Time In Searching Minimum Value In Weak #904
What is the worst case time in searching minimum value in weak -heap?
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 Heap - Weak Heap - Quiz No.1.
What is the worst case time in searching minimum value in weak -heap?
O(log n)
O(n)
O(n logn)
O(1)
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
