Computer Quiz for Grade 1: AVL trees and Heaps

What is an AVL tree?

• A type of fruit tree

• A type of animal in the Amazon rainforest

• A type of computer virus

• A self-balancing binary search tree

How are AVL trees different from regular binary search trees?

• AVL trees automatically balance themselves, while regular binary search trees do not.

• AVL trees cannot store as much data as regular binary search trees

• AVL trees are slower than regular binary search trees

• AVL trees have fewer nodes than regular binary search trees

What are the rotations used in AVL trees?

• Left and right rotations

• Horizontal and vertical rotations

• Single and double rotations

• Clockwise and counterclockwise rotations

Explain the concept of single rotation in AVL trees.

• Balancing technique used to balance the AVL tree by rotating the nodes to maintain balance factor.

• Technique used to rotate the entire tree

• Method to remove nodes from the AVL tree

• Process of converting AVL tree into a binary search tree

What is the balancing factor in AVL trees?

• The difference in height between the left and right subtrees of a node

• The color of the nodes in the tree

• The depth of the tree

• The number of nodes in the tree

How is the balancing factor used to maintain balance in AVL trees?

• By ignoring the balancing factor

• By removing nodes with high balancing factor

• By randomly adjusting the nodes

• By comparing the balancing factor of each node and performing rotations to maintain balance.

What is a Max heap?

• A complete binary tree where the value of each node is greater than or equal to the values of its children.

• A tree where the value of each node is equal to the values of its children

• A tree where the value of each node is not related to the values of its children

• A tree where the value of each node is less than the values of its children

Explain the properties of a Min heap.

• Min heap properties include being a balanced binary tree and the value of each node is greater than the values of its children.

• Min heap properties include being a linked list and the value of each node is greater than the values of its children.

• Min heap properties include being a complete binary tree and the value of each node is less than or equal to the values of its children.

• Min heap properties include being a random binary tree and the value of each node is greater than the values of its children.

How does the heap sort algorithm work?

• By sorting the elements in ascending order

• By building a max heap and repeatedly removing the largest element

• By randomly rearranging the elements

• By using a bubble sort algorithm

Explain the steps involved in performing heap sort.

• Sorting the elements in ascending order

• Using a stack to store the elements

• Randomly selecting elements to add to the sorted array

• Creating a heap from the input data, removing the largest element from the heap and adding it to the sorted array, and reconstructing the heap to maintain the heap property.