Balanced Binary Tree Multiple Choice Mcqs Online Exam Quiz

Balanced Binary Tree Multiple Choice Mcqs GK Quiz. Question and Answers related to Balanced Binary Tree Multiple Choice Mcqs. MCQ (Multiple Choice Questions with answers about Balanced Binary Tree Multiple Choice Mcqs

A binary tree is balanced if the difference between left and right subtree of every node is not more than ____

Options

A : 1

B : 3

C : 2

D : 0

View Answer

Figure below is a balanced binary tree. If a node inserted as child of the node R, how many nodes will become unbalanced?

Options

A : 2

B : 1

C : 3

D : 0

View Answer

What will be the height of a balanced full binary tree with 8 leaves?

Options

A : 8

B : 5

C : 6

D : 4

View Answer

The balance factor of a node in a binary tree is defined as _____

Options

A : addition of heights of left and right subtrees

B : height of right subtree minus height of left subtree

C : height of left subtree minus height of right subtree

D : height of right subtree minus one

View Answer

Which of the following tree data structures is not a balanced binary tree?

Options

A : AVL tree

B : Red-black tree

C : Splay tree

D : B-tree

View Answer

Which of the following is an advantage of balanced binary search tree, like AVL tree, compared to binary heap?

Options

A : insertion takes less time

B : deletion takes less time

C : searching takes less time

D : construction of the tree takes less time than binary heap

View Answer

Balanced binary tree with n items allows the lookup of an item in ____ worst-case time.

Options

A : O(log n)

B : O(nlog 2)

C : O(n)

D : O(1)

View Answer

Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in ____ time.

Options

A : O(m+n)

B : O(mn)

C : O(m)

D : O(mlog n)

View Answer

Which of the following data structures can be efficiently implemented using height balanced binary search tree?

Options

A : sets

B : priority queue

C : heap

D : both sets and priority queue

View Answer

AVL trees are more balanced than Red-black trees.

Options

A : True

B : False

C :

D :

View Answer

Chemical Engineering Basics - Part 1 more Online Exam Quiz

Automata Theory Mealy Machine

Automata Theory Mealy Machine 1

Automata Theory Moore Machine

Automata Theory Turing Machine Halting

Backtracking Multiple Choice Mcqs

Balanced Parenthesis Multiple Choice Mcqs

Basic Civil Engineering Basic Surveying Terms

Basic Civil Engineering Classification Timber

Basic Civil Engineering Fine Aggregates

Basic Civil Engineering Port Harbour Engineering