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

Across

1. It is the process of visiting all the nodes in a binary search tree in a specific order, such as in-order, pre-order and post-order.

2. A sort algorithm that looks at the elements of the array to be sorted to determine their relative order.

3. It is the element being searched for in the binary search algorithm.

4. The number of times two elements are compared during the sorting process.

5. A measure of how much time and/or space is required to execute an algorithm or program.

6. The time or space complexity of an algorithm when it receives average inputs.

7. It is the range of elements in which the binary search algorithm looks for the target element.

8. A measure of time complexity in which the execution time increases linearly with the size of the input.

9. A sorting algorithm that rearranges the original array without using additional memory.

Down

10. A function or algorithm that calls itself with a smaller version of the problem until a base case is reached.

11. A step-by-step process for solving a problem or achieving a specific goal.

12. The process of checking two items and determining which one is greater or smaller than the other.

13. It is a traversing method for binary search trees where the root is visited first, followed by the left and right subtrees recursively.

14. The amount of memory an algorithm requires to solve a problem as a function of the size of the input.

15. It is an array where the elements are arranged in increasing order.

16. Algorithm that searches a sorted list or array by repeatedly dividing in half until the desired item is found.

17. An informal high-level description of the operating principle of a computer program is a non-specific outline that summarizes how the program functions.

🖶