Data Structure Avl Tree Online Exam Quiz
Data Structure Avl Tree GK Quiz. Question and Answers related to Data Structure Avl Tree. MCQ (Multiple Choice Questions with answers about Data Structure Avl Tree
What is an AVL tree?
Options
A : a tree which is balanced and is a height balanced tree
B : a tree which is unbalanced and is a height balanced tree
C : a tree with three children
D : a tree with atmost 3 children
Why to prefer red-black trees over AVL trees?
Options
A : Because red-black is more rigidly balanced
B : AVL tree store balance factor in every node which costs space
C : AVL tree fails at scale
D : Red black is more efficient
Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?
Options
A : just build the tree with the given input
B : find the median of the set of elements given, make it as root and construct the tree
C : use trial and error
D : use dynamic programming to build the tree
What maximum difference in heights between the leafs of a AVL tree is possible?
Options
A : log(n) where n is the number of nodes
B : n where n is the number of nodes
C : 0 or 1
D : atmost 1
What is the maximum height of an AVL tree with p nodes?
Options
A : p
B : log(p)
C : log(p)/2
D : p?2
Why we need to a binary tree which is height balanced?
Options
A : to avoid formation of skew trees
B : to save memory
C : to attain faster memory access
D : to simplify storing
To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?
Options
A : true
B : false
C :
D :
Data Structure Adjacency List more Online Exam Quiz
Data Structure Adjacency Matrix
Data Structure Array Array Operations
Data Structure Assembly Line Scheduling
Data Structure Balanced Partition
Data Structure Binary Search Iterative