| 1/12 | 17 | ||||||||||||||||||||||||
| 2 | |||||||||||||||||||||||||
| 15 | |||||||||||||||||||||||||
| 3 | |||||||||||||||||||||||||
| 4 | |||||||||||||||||||||||||
| 5 | |||||||||||||||||||||||||
| 13 | |||||||||||||||||||||||||
| 6 | |||||||||||||||||||||||||
| 11 | 18 | ||||||||||||||||||||||||
| 7/14 | 16 | ||||||||||||||||||||||||
| 8 | |||||||||||||||||||||||||
| 9 | |||||||||||||||||||||||||
| 10 | |||||||||||||||||||||||||
1. It is the amount of time taken by an algorithm to run as a function of the size of the input.
2. It is a traversing method for binary search trees where the left and right subtrees are first recursively traversed, followed by the root.
3. It is the range of elements in which the binary search algorithm looks for the target element.
4. It is the repetition of a process in order to achieve a desired outcome, usually with the aim of approaching a goal in small steps.
5. A problem-solving strategy that involves breaking a problem into smaller sub-problems, solving them independently and combining their solutions.
6. 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.
7. It is the amount of memory used by an algorithm to run as a function of the size of the input.
8. It is a traversing method for binary search trees where the root is visited first, followed by the left and right subtrees recursively.
9. It is a position in an array where an element is located.
10. It is a data structure that allows fast searching, insertion and deletion of elements, using the binary search algorithm on a sorted tree.
11. It is the act of checking if two values are equal, greater than or less than each other.
12. It is the element being searched for in the binary search algorithm.
13. It is a node in a binary search tree that has no children.
14. It is an array where the elements are arranged in increasing order.
15. It is the length of the longest path from a node to a leaf in a binary search tree.
16. It is the point in the search interval that divides it into two equal halves.
17. 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.
18. Algorithm that searches a sorted list or array by repeatedly dividing in half until the desired item is found.