Question: If the out degree of every node is exactly equal to M or 0 and the number of nodes at level K is Mk-1 [consider root at level 1], then tree is called as (i) Full m-ary try (ii) Complete m-ary tree (iii)Positional m-ary tree
Answer:
MCQ: If the out degree of every node is exactly equal to M or 0 and the number of nodes at level K is Mk-1 [consider root at level 1], then tree is called as (i) Full m-ary try (ii) Complete m-ary tree (iii)Positional m-ary tree
Correct Answer:
A. Only (i)
Discuss a Question
Related Questions
- 1. If all c(i, j )’s and r(i, j)’s are calculated, then OBST algorithm in worst case takes one of the following time.
- 2. The upper bound on the time complexity of the nondeterministic sorting algorithm is
- 3. The worst case time complexity of the nondeterministic dynamic knapsack algorithm is
- 4. Recursive algorithms are based on
- 5. What do you call the selected keys in the quick sort method?
- 6. How do you determine the cost of a spanning tree?
- 7. The time complexity of the normal quick sort, randomized quick sort algorithms in the worst case is
- 8. Let there be an array of length ‘N’, and the selection sort algorithm is used to sort it, how many times a swap function is called to complete the execution?
- 9. The Sorting methodwhich is used for external sort is
- 10. Which is the brain of computer:
You may be interested in:
Data Structure Multiple Choice Questions And Answers (MCQs)Recently Added Articles
How Can AI Simplify the Academic Life of Students?
Last updated on: April 16, 2025Posted by: ExamRadar
Want to Clear IBPS RRB PO? Master These Mock Test Hacks!
Last updated on: March 10, 2025Posted by: ExamRadar
Top AI Tools for Instantly Detecting Plagiarized Writing
Last updated on: December 5, 2024Posted by: ExamRadar
Applying Algorithmic Trading Techniques to Forex: Insights for Programmers and Data Scientists
Last updated on: November 22, 2024Posted by: ExamRadar
Image to Text Conversion Made Easy: Online Tool Insights
Last updated on: April 12, 2024Posted by: ExamRadar
