Question: In an arbitrary tree ( not a search tree) of order M. Its size is N, and its height is K. The computation time needed to find a data item on T is
Answer:
MCQ: In an arbitrary tree ( not a search tree) of order M. Its size is N, and its height is K. The computation time needed to find a data item on T is
Correct Answer:
A. O(K*K)
Discuss a Question
Related Questions
- 1. Which of the following belongs to the algorithm paradigm?
- 2. If f,t: N→ R+, then t (n) Ω (f (n)), iff f(n) O (t (n)) is known as
- 3. The time taken by NP-class sorting algorithm is
- 4. Find the odd one out from the following categories of algorithms.
- 5. The time complexity of binary search in best, worst cases for an array of size N is
- 6. Which of following algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order?
- 7. The mathematical definition for Omega can be defined as, provided f,g:NR+ and c is a positive constant and n > n0,
- 8. The notation is
- 9. From the following choose the one which belongs to the algorithm paradigm other than . to which others from the following belongs to.
- 10. Identify the name of the sorting in which time is not proportional to n2.
You may be interested in:
Data Structure Multiple Choice Questions And Answers (MCQs)Recently Added Articles
How Do Java Development Teams Use Docker and Kubernetes to Deploy Applications?
Last updated on: April 24, 2026Posted by: ExamRadar
AI vs Machine Learning: Key Differences Every Professional Should Know
Last updated on: February 13, 2026Posted by: ExamRadar
Office Cleaning Services That Elevate Sydney Offices
Last updated on: February 11, 2026Posted by: ExamRadar
What You Actually Learn About Exam Patterns From RBI Grade B Previous Year Papers?
Last updated on: February 9, 2026Posted by: ExamRadar
Mental Health Support That’s Closer Than You Think
Last updated on: January 7, 2026Posted by: ExamRadar
Transform Your Home’s Exterior with Columbus roofing company
Last updated on: November 27, 2025Posted by: ExamRadar
