Running Time Analysis: Give the tightest possible upper bound for the worst case running time for each of the following in terms of N. ( Please fill the answers in the same sequence as appear below. ) Delete in a Binary Search Tree of size N. 2. Insert in a Splay Tree of size N. Inserting a value into an AVL tree of size N. 4. Post-order traversal of a Binary Search Tree containing N elements. 5. Given a binary min heap, find which value is the minimum value and delete it.

Write a program that prints the day number of the year, given the date in the form month-day-year. for example, if the input is 1-1-2006, the day number is 1; if the input is 12-25-2006, the day number is 359. the program should check for a leap year. a year is a leap year if it is divisible by 4, but not divisible by 100. for example, 1992 and 2008 are divisible by 4, but not by 100. a year that is divisible by 100 is a leap year if it is also divisible by 400. for example, 1600 and 2000 are divisible by 400. however, 1800 is not a leap year because 1800 is not divisible by 400.