Print all edge nodes of a complete binary tree anti-clockwise.
That is all the left most nodes starting at root, then the leaves left to right and finally all the rightmost nodes.
In other words, print the boundary of the tree.

Variant: Print the same for a tree that is not complete.

(I traversed the tree twice, but interviewer said there is a recursive way to solve this)

Given a matrix of integers where every row is sorted and every column is sorted. Print all elements in sorted order.

Cannot use merging of arrays. Solution should be better than O(n2logn)

Given is an array of integers. Element is called an extreme if no other element's value is more distant from the average. Write a function

int extreme(int[] A);

that given an array of integers returns the index of an extreme (any one of them if there are many).

If no extreme exists, the function should return -1.

A[0]=9, A[1]=4, A[2]=-3, A[3]=-10

the index of an extreme is 3, because the average of the array is

(9 + 4 + (-3) + (-10)) / 4 = 0

and in this array no value is further from 0 than -10