| 1 | 17 | |||||||||||||||||||||||
| 2 | 19 | |||||||||||||||||||||||
| 3 | ||||||||||||||||||||||||
| 4 | 18 | |||||||||||||||||||||||
| 5/14 | ||||||||||||||||||||||||
| 6 | ||||||||||||||||||||||||
| 7 | ||||||||||||||||||||||||
| 9 | 8 | |||||||||||||||||||||||
| 10 | ||||||||||||||||||||||||
| 15 | 16 | 11 | ||||||||||||||||||||||
| 12 | ||||||||||||||||||||||||
| 13 | ||||||||||||||||||||||||
1. It is a traversing method for binary search trees where the left subtree is recursively traversed, followed by the root, and then the right subtree.
2. It is the length of the longest path from a node to a leaf in a binary search tree.
3. A sorting algorithm that does not require extra space for temporary arrays or data structures.
4. A sorting algorithm that preserves the relative order of equal elements in the sorted output.
5. It is the element being searched for in the binary search algorithm.
6. A variant of merge sort that does not require extra space for temporary arrays or data structures.
7. An informal high-level description of the operating principle of a computer program is a non-specific outline that summarizes how the program functions.
8. A data type that can have one of two possible values, usually true or false.
9. The process of combining two or more sorted sub-arrays into a single sorted array.
10. A problem-solving strategy that involves breaking a problem into sub-problems, solving each sub-problem independently, and then combining the solutions to solve the original problem.
11. The process of improving the performance of an algorithm by reducing its time or space complexity.
12. It is the range of elements in which the binary search algorithm looks for the target element.
13. The amount of memory used by an algorithm as the input size increases.
14. The amount of time it takes to complete a task as the input size increases.
15. The process of exchanging two items in a list or array.
16. A function or algorithm that calls itself with a smaller version of the problem until a base case is reached.
17. A step-by-step process for solving a problem or achieving a specific goal.
18. It is a data structure that allows fast searching, insertion and deletion of elements, using the binary search algorithm on a sorted tree.
19. The scenario in which an algorithm takes an average amount of time to solve a given problem.