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

What is the time complexity of pre-order traversal in the iterative fashion?

O(1)

O(n)

O(logn)

O(nlogn)

Discussion

MCQ

Consider below sequences:

array=60 90 10 100 40 150 90

reverse 2 to 3

array=60 10 90 100 40 150 90

reverse 3 to 6

array= 60 100 150 40 100 90 90

now printout from 1 to 6 :-- 60 100 150 40 100 90

How to achieve the above operation efficiently?

use linked lists

use avl trees

use red-black trees

use treaps (cartesian trees)

Discussion

MCQ

What does the below definations convey?i. A binary tree is balanced if for every node it is gonna hold that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.ii. A binary tree is balanced if for any two leaves the difference of the depth is at most 1.

weight balanced and height balanced tree definations

height balanced and weight balanced tree definations

definations of weight balanced tree

definations of height balanced tree

Discussion

MCQ

Which one of the following statements is false?

Breadth-first search cannot be used to find connected components of a graph.

Given the prefix and postfix walks of a binary tree, the binary tree cannot be uniquely reconstructed.

Both (a) and (b)

Optimal binary search tree construction can be performed efficiently using dynamic programmmg.

Discussion

MCQ

What are the operations that can be performed on weight balanced tree?

all basic operations and set intersection, set union and subset test

all basic operations

set intersection, set union and subset test

only insertion and deletion

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