Menu

Question Discussion & Solution

MCQ
Q.
Each node of a tree stores a data value and has zero or more pointers pointing to the other nodes of the tree, which are also known as its__________.

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.
Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?
forum Discussion
MCQ
2.
A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?
forum Discussion
MCQ
3.
The null left pointer pointing to predecessor and null right pointer pointing to successor. how many types of threaded tree are possible with this convention?
forum Discussion
MCQ
4.
A full binary tree with 2n+1 nodes contain
forum Discussion
MCQ
5.
The number of edges from the node to the deepest leaf is called _________ of the tree.
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