Menu

Question Discussion & Solution

MCQ
Q.
Which concept is useful while writing programming code for implementing various operations on trees?

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.
In which tree, the right NULL pointer of each node (not having a right child node) points to its in-order successor?
forum Discussion
MCQ
2.
Binary search tree has best case run-time complexity of ?(log n). What could the worst case?
forum Discussion
MCQ
3.
A-2-3 tree is a tree such that 1. All internal nodes have either 2 or 3 children. 2. All paths from root to the leaves have the same length. The number of internal nodes of a 2-3 tree having 9 leaves could be
forum Discussion
MCQ
4.
Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
forum Discussion
MCQ
5.
State true of false.i) A node is a parent if it has successor nodes.ii) A node is child node if out degree is one.
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