Menu

Question Discussion & Solution

MCQ
Q.
The depth of a complete binary tree with 'n nodes is (log is to be base two)

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.
When converting binary tree into extended binary tree, all the original nodes in binary tree are
forum Discussion
MCQ
2.
How many distinct binary search trees can be formed which contains the integers 1, 2, 3?
forum Discussion
MCQ
3.
In a full binary tree if number of internal nodes is I, then number of nodes N are?
forum Discussion
MCQ
4.
What may be the content of a node in threaded binary tree?
forum Discussion
MCQ
5.
A complete binary tree with the property that the value of each node is at least as large as the values of its children is known as ..............
forum Discussion

category More Data Structure Topics

article

Data Structure Basics

format_list_bulleted 128 MCQs
Practice arrow_forward
article

Abstract data types

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Arrays

format_list_bulleted 134 MCQs
Practice arrow_forward
article

Lists

format_list_bulleted 166 MCQs
Practice arrow_forward
article

Stacks

format_list_bulleted 165 MCQs
Practice arrow_forward
article

Queues

format_list_bulleted 61 MCQs
Practice arrow_forward
article

Trees

format_list_bulleted 133 MCQs
Practice arrow_forward
article

Binary Trees

format_list_bulleted 120 MCQs
Practice arrow_forward
article

B Trees

format_list_bulleted 8 MCQs
Practice arrow_forward
article

Heaps

format_list_bulleted 36 MCQs
Practice arrow_forward
article

Hash based structures

format_list_bulleted 7 MCQs
Practice arrow_forward
article

Graphs

format_list_bulleted 157 MCQs
Practice arrow_forward
article

Mixed

format_list_bulleted 10 MCQs
Practice arrow_forward