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

How Image to Text Conversion Make Printed Study Materials Easier to Use?

Last updated on: October 23, 2026Posted by: ExamRadar

7 Best Online Exam Makers for Teachers, Schools, and Businesses

Last updated on: October 21, 2026Posted by: ExamRadar

How to pick a Bintan resort when you’ve only got 48 hours

Last updated on: September 23, 2026Posted by: ExamRadar

Features to Look for While Choosing the Best Automation Tool

Last updated on: July 15, 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