EXAMRADAR

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

You may be interested in:

Data Structure Multiple Choice Questions And Answers (MCQs)

Recently Added Articles

Kahoot Winner Strategies

Top 5 Kahoot Winner Strategies Students Are Using Right Now

Last updated on: May 14, 2025Posted by: ExamRadar

Daily Routine to Cover the RBI Grade B Syllabus Fast

Last updated on: May 14, 2025Posted by: ExamRadar

How Can AI Simplify the Academic Life of Students?

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

5 Important Tools for System Administrators

Last updated on: December 1, 2024Posted by: ExamRadar