For each of the following algorithms performed on a collection of n integers, write down its worst-case order of complexity as a function of n in simplified Big O notation. Assume that the most efficient data structure and algorithm are used. Algorithm Finding the maximum value of a heap (heap is organized as described in lecture notes). Preorder traversal of a binary tree. Finding a target in a binary search tree. Removing an element from a queue, which is implemented using a singly linked list. Finding a target in a Red-Black tree. Inserting a new value into a heap. Print the data values in a balanced binary search tree sorted in an increasing order. Finding a target in a sorted array using binary search method. Worst-case order of complexity

For each of the following algorithms performed on a collection of n integers, write down its worst-case order of complexity as a function of n in simplified Big O notation. Assume that the most efficient data structure and algorithm are used. Algorithm Finding the maximum value of a heap (heap is organized as described in lecture notes). Preorder traversal of a binary tree. Finding a target in a binary search tree. Removing an element from a queue, which is implemented using a singly linked list. Finding a target in a Red-Black tree. Inserting a new value into a heap. Print the data values in a balanced binary search tree sorted in an increasing order. Finding a target in a sorted array using binary search method. Worst-case order of complexity