Menu

Question Discussion & Solution

MCQ
Q.
A binary tree is said to be an extended binary tree (also known as 2-tree) if all of its nodes are of _______.

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.
A complete binary tree with n leaf nodes has ..............
forum Discussion
MCQ
2.
Which of the following is correct with respect to binary trees?
forum Discussion
MCQ
3.
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called
forum Discussion
MCQ
4.
In order to get the contents of a Binary search tree in ascending order, one has to traverse it in
forum Discussion
MCQ
5.
The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum
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