In binary heap, whenever the root is removed then the rightm...

MCQ

In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?

It is the easiest possible way.

To make sure that it is still complete binary tree.

Because left and right subtree might be missing.

None of the above.

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the farthest leaf) of such a tree on k nodes can be described as

log2 n

log4/3 n

log3 n

log3/2 n

Discussion

MCQ

What is a splay operation?

moving parent node to down of child

moving a node to root

moving root to leaf

removing leaf node

Discussion

MCQ

Visiting root node after visiting left and right sub-trees is called

In-order Traversal

Pre-order Traversal

Post-order Traveral

None of the above

Discussion

MCQ

State true or false.i) An empty tree is also a binary tree.ii) In strictly binary tree, the out-degree of every node is either o or 2.

True, False

False, True

True, True

False, False

Discussion

MCQ

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?

no there is no special usage

In real time it is estimated that 80% access is only to 20% data, hence most used ones must be easily available

redblack and avl are not upto mark

they are just another type of self balancing binary search trees

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics