Menu

Question Discussion & Solution

MCQ
Q.
A binary tree of depth "d" is an almost complete binary tree if

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
Traversing a binary tree first root and then left and right subtrees called _______traversal.
forum Discussion
MCQ
2.
A binary tree can easily be converted into q 2-tree
forum Discussion
MCQ
3.
The linked representation of a binary tree is implemented by using a linked list having an_________.
forum Discussion
MCQ
4.
What is a complete binary tree?
forum Discussion
MCQ
5.
Why we need to a binary tree which is height balanced?
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
article

Abstract data types

format_list_bulleted 37 MCQs
article

Arrays

format_list_bulleted 134 MCQs
article

Lists

format_list_bulleted 166 MCQs
article

Stacks

format_list_bulleted 165 MCQs
article

Queues

format_list_bulleted 61 MCQs
article

Trees

format_list_bulleted 133 MCQs
article

Binary Trees

format_list_bulleted 120 MCQs
article

B Trees

format_list_bulleted 8 MCQs
article

Heaps

format_list_bulleted 36 MCQs
article

Hash based structures

format_list_bulleted 7 MCQs
article

Graphs

format_list_bulleted 157 MCQs
article

Mixed

format_list_bulleted 10 MCQs