What Is The Time Complexity For Deleting Root Key In A Ternary #951
What is the time complexity for deleting root key in a ternary heap of n elements?
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 - Ternary Heap – 2 - Quiz No.1.
What is the time complexity for deleting root key in a ternary heap of n elements?
O (log n/ log 3)
O (3log n/ log 3)
O (n)
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
