1		9
2/8
								14
						3
						4
						11/12
5				10
			6						15
							13
		7

Across

1. A graph traversal algorithm that explores as far as possible along each branch before backtracking.

2. The operation of retrieving the topmost element from the stack without removing it.

3. A structure in which the key in each node is greater than all keys in its left subtree and smaller than all keys in its right subtree.

4. A FIFI data structure, with wraparound code forming a circular arrangement.

5. A pointer that indicates the rear (or last) element of a circular queue.

6. An alternate term for the front pointer of a circular queue.

7. A graph traversal algorithm that explores all the vertices of a graph in breadth-first order, i.e., visiting all the vertices at the same 'level' before moving on to the next 'level'.

Down

8. A tree traversal algorithm that visits the left subtree first, then the right subtree, and finally the root node.

9. A tree traversal algorithm that visits the root node first, then recursively visits the left subtree and finally the right subtree.

10. A data structure that allows insertion and deletion of elements with different priorities.

11. A tree data structure in which each node has at most two children, which are referred to as the left child and the right child.

12. A tree data structure in which each node has at most two children.

13. A data structure that follows the Last-In-First-Out (LIFO) principle.

14. A tree traversal algorithm that visits the left subtree first, then the root node, and finally the right subtree.

15. A function that checks if a circular queue is full and unable to add more elements.

🖶