New game
Download
SCORM download
To be used in an LMS (Moodle, Blackboard...)
Regular download
To be published on a website or blog.
Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.
Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.
Get Academic Plan
If you wish, you can download a demo game here and test its integration:
Share game
Quiz
Quiz

Data Structures - Trees & Heaps

Integrate it into your platform
G. Classroom M. Teams
You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

Get Academic Plan
You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Get Academic Plan
Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Get Academic Plan

Data Structures - Trees & Heaps

Quiz

(1)
Played 52
Create copy

About this activity

Quiz on trees, BST, AVL, and heap sort.

Created by

Amutha A L
Amutha A L
India

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game
Make challenge

Top Games

 %
Anonymous
Anonymous
 %
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Get Academic Plan
Print your game
Data Structures - Trees & Heaps
 

Data Structures - Trees & HeapsOnline version

Quiz on trees, BST, AVL, and heap sort.

by Amutha A L
1

What is the maximum number of children a binary tree node can have?

2

In a Binary Search Tree, which property must a node maintain?

3

What rotation is used to fix a left-right AVL violation?

4

Which operation in a BST can be O(h) time in average case?

5

What makes an AVL tree distinct from a BST?

6

Which data structure is primarily used to implement heap sort?

7

In a max-heap, the root node is always:

8

What is the time complexity of building a binary heap from n elements?

9

Which step follows extracting the root in heap sort?

10

Which property must hold for a node in a binary tree?

11

What property defines a binary search tree (BST)?

12

What is the time complexity to search in a balanced BST?

13

Which traversal visits nodes in increasing order for BST?

14

What is a heap’s main property?

15

Which heap variant supports quick access to the maximum element?

16

What is the height of a complete binary tree with n nodes?

17

Which operation removes the root in a min-heap and preserves heap property?

18

Which data structure is ideal for priority queue operations?

19

Which property is not guaranteed in a general binary tree?

20

Which operation maintains the heap after insertion?

 
Are you sure you want to leave the page?

If you leave, you will lose the game in progress.