Menu

Question Discussion & Solution

MCQ
Q.
How many distinct binary search trees can be formed which contains the integers 1, 2, 3?

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.
The depth of a complete binary tree is given by
forum Discussion
MCQ
2.
A complete Binary Tree with 15 nodes contains ................. edges.
forum Discussion
MCQ
3.
One can make an exact replica of a Binary Search Tree by traversing it in ...............
forum Discussion
MCQ
4.
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
MCQ
5.
In a full binary tree if number of internal nodes is I, then number of leaves L are?
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