Data Structures - Trees & Heaps

Test

(1)

Jugadas 52

Crear copia

Sobre esta actividad

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

Creada por

Amutha A L

India

Descarga la versión para jugar en papel

Top 10 resultados

#	Jugador	Acierto	tiempo
1	sambit 8 de Enero de 2026	% 85	06:56

¿Quieres aparecer en el Top 10 de este juego? Inicia sesión para identificarte.

Crea tu propio juego gratis desde nuestro creador de juegos

Compite contra tus amigos para ver quien consigue la mejor puntuación en esta actividad

Crear reto

Brawl stars preguntas

Carlos Andrés Prieto Rodríguez

Colombia

(164)

Completa todas las preguntas
Verbos irregulares en Inglés

Hélmer González Serrano

Colombia

(309)

Se presentan 10 preguntas, cada una con 4 opciones de respuesta. Seleccione la que considere correcta.
cuanto sabes de Futbol

hugo estay

Chile

(316)

este test esta basado en las diapositivas que pudimos ver con anterioridad, consta de 10 preguntas las cuales tienen alternativas para poder resolverlas.
Cultura general española

Ernest Serret

España

(100)

Responde las siguientes preguntas
Tipos de sintagmas (II)

idoia rubio

España

(945)

Actividades interactivas para reconocer los distintos tipos de sintagmas

		%
	Anónimo	%
		%
		%

Imprime tu juego

Data Structures - Trees & Heaps


Data Structures - Trees & HeapsVersión en línea Quiz on trees, BST, AVL, and heap sort. por Amutha A L 1 What is the maximum number of children a binary tree node can have? a 4 b 1 c 3 d 2 2 In a Binary Search Tree, which property must a node maintain? a Right subtree nodes are equal to the root b Tree is always balanced c Left subtree keys < node key; right subtree keys > node key d All keys in left are greater 3 What rotation is used to fix a left-right AVL violation? a Single left rotation b Single right rotation c Right-Left rotation d Left-Right rotation 4 Which operation in a BST can be O(h) time in average case? a Search b Deletion c Insertion d Traversal 5 What makes an AVL tree distinct from a BST? a Nodes can have more than two children b Self-balancing with height difference at most 1 c It is not ordered d Always has zero height 6 Which data structure is primarily used to implement heap sort? a Binary search tree b Queue c Binary heap d Linked list 7 In a max-heap, the root node is always: a The minimum element b The maximum element c Always a leaf d A random element 8 What is the time complexity of building a binary heap from n elements? a O(n log n) b O(n) c O(n^2) d O(log n) 9 Which step follows extracting the root in heap sort? a Swap with last element and stop b Heapify the new root c Sort the entire heap again d Delete a node from the heap 10 Which property must hold for a node in a binary tree? a All leaves are internal b Nodes must have one child only c Each node has at most two children d Nodes must have exactly two children 11 What property defines a binary search tree (BST)? a Height must be even b Nodes store duplicate keys only on left c Left subtree keys are less than root; right are greater d All nodes have two children 12 What is the time complexity to search in a balanced BST? a O(n^2) b O(log n) c O(n log n) d O(1) 13 Which traversal visits nodes in increasing order for BST? a Preorder traversal b Inorder traversal c Level-order traversal d Postorder traversal 14 What is a heap’s main property? a All leaves have the same value b Children are always equal c Parent is greater (or smaller) than children in a heap-order d Tree is always complete only on the left 15 Which heap variant supports quick access to the maximum element? a Binary search tree b AVL tree c Min-heap d Max-heap 16 What is the height of a complete binary tree with n nodes? a O(log n) b O(n) c O(sqrt(n)) d O(1) 17 Which operation removes the root in a min-heap and preserves heap property? a Pop-first b Delete-root c Heapify-bottom d Extract-min 18 Which data structure is ideal for priority queue operations? a Binary heap b Linked list c Hash table d Graph 19 Which property is not guaranteed in a general binary tree? a Balanced height b Each node stores a key c At most two children per node d There is a root 20 Which operation maintains the heap after insertion? a Rotate left b Bubble up (sift up) c Bubble down (sift down) d Split

Puedes integrar el juego en un LMS compatible con LTI 1.1 o LTI 1.3 como Canvas, Moodle, o Blackboard. De esta manera podrás guardar las puntuaciones automáticamente en el libro de calificaciones de esa plataforma.

Data Structures - Trees & Heaps

Test

Sobre esta actividad

Creada por

Descarga la versión para jugar en papel

Top juegos

Test

Brawl stars preguntas

Test

Verbos irregulares en Inglés

Test

cuanto sabes de Futbol

Test

Cultura general española

Test

Tipos de sintagmas (II)

Data Structures - Trees & HeapsVersión en línea

por Amutha A L

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

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

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

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

What makes an AVL tree distinct from a BST?

Which data structure is primarily used to implement heap sort?

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

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

Which step follows extracting the root in heap sort?

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

What property defines a binary search tree (BST)?

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

Which traversal visits nodes in increasing order for BST?

What is a heap’s main property?

Which heap variant supports quick access to the maximum element?

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

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

Which data structure is ideal for priority queue operations?

Which property is not guaranteed in a general binary tree?

Which operation maintains the heap after insertion?