Avatto > UGC NET COMPUTER SCIENCE > PRACTICE QUESTIONS > Data Structures and Algorithms > Trees

Data Structures and Algorithms MCQ - Trees

16 The maximum number of nodes on level i of a binary tree is

17 The smallest number of key that will force a B-tree of order 3 to have a height 3 is

18 A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves

A strictly binary tree with 'n' leaves must have (2n � 1) nodes. Verify for some small 'n'. This can be proved by the principle of mathematical induction.

19 Number of possible binary trees with 3 nodes is

20 A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from the root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves could be

Your Progress

0%

Start Practising!

You've answered 0 of 30 questions in this topic.

Practice Spotlight

Build momentum in Trees

Start with a short question set, review every explanation, and revisit difficult questions before moving ahead.

Day 4 / 10

Global Spotlight

Build Your First Streak

Complete one short Trees session today, then return tomorrow. Consistency matters more than a long first session.

Day 7 / 10

Question Spotlight

Question:

A full binary tree with n leaves contains

A. n nodes
B. log2n nodes
C. 2n - 1 nodes
D. 2n+1 nodes

Correct answer: C

Click to view the complete question details

Day 4 / 10 Open this question

Community Insight

Based on 44 saved attempts

Most Attempted TopicTrees
Most Challenging TopicAdvanced Algorithm
Average Accuracy84%

Featured Question

(Based on recent community answers)

Q. #18511100% Incorrect

A binary tree having n nodes and depth d will be about complete binary tree…

Try This Question →

This Week's Challenge

Complete 20 questions and set the community benchmark!

0 / 20 Start Challenge →

Why Practice with Avatto?

High Quality MCQsExam-focused questions with accurate answers

Detailed ExplanationsStep-by-step explanations to enhance learning

Latest Exam PatternBased on updated syllabus and pattern

Performance AnalyticsTrack performance and improve weak areas

100% Free PracticePractice unlimited questions for free

Forgot your password?

I agree with the Terms.