New game
Download
Get Academic Plan
Share game
Integrate it into your platform

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.

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.

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:

Linked Lists & Recursion Quiz

Quiz

Played 5

About this activity

Test basics of lists and recursion.

Created by

Philippines

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

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.

Print your game
Linked Lists & Recursion Quiz
 

Linked Lists & Recursion QuizOnline version

Test basics of lists and recursion.

by Renniel Ivan Exclamador
1

What is the base case in recursion?

2

Which linked list allows traversal in both directions?

3

Time complexity of inserting at the beginning of a singly linked list is:

4

Which pointer does a doubly linked list node have that a singly linked list node does not?

5

Deleting at the end of a singly linked list requires:

6

Which structure changes size dynamically at runtime?

7

Which condition stops recursion from infinite calls?

8

In a circular linked list, last node points to:

9

Memory overhead is higher in:

10

Algorithm that calls itself is:

Are you sure you want to leave the page?

If you leave the page, you will lose your game progress.