Menu

Question Discussion & Solution

MCQ
Q.
What is the special property of red-black trees and what root should always be?

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.
What is missing in this logic of finding a path in the tree for a given sum (i.e checking whether there will be a path from roots to leaf nodes with given sum)?

checkSum(struct bin-treenode *root , int sum) :
  if(root==null)
    return sum as 0
  else :
     leftover_sum=sum-root_node-->value
     //missing
forum Discussion
MCQ
2.
State true or false.i) The degree of root node is always zero.ii) Nodes that are not root and not leaf are called as internal nodes.
forum Discussion
MCQ
3.
A __________is a non-linear data structure representing the hierarchical structure of one or more elements known as nodes.
forum Discussion
MCQ
4.
What are the applications of weight balanced tree?
forum Discussion
MCQ
5.
When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?
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