# Interview Questionaire

This interview will consist of 2 questions that test you algorithm and DS skills.
You are free to use any language / IDE.

## Question 1
Given an array of random positive numbers, move all the zeroes to the left of the array. 

order of the non zero elements does not matter.

Input :  arr[] = {0, 1, 2, 5, 0, 3, 0, 3};
Output : arr[] = {0, 0, 0, 1, 2, 3, 3, 5};

Input:  arr[] = {0}
Output: arr[] = {0}

Input:  arr[] = {0,1,0,3,12}
Output: arr[] = {0,0,1,3,12}

### Answer

# Question 2

//        1 <---- root
//     /     \
//    2       3
//   / \     / \
//  4   5   6   7
//
//
// 1) create the node type
// 2) write a function to print tree by level 
// ie. print "1,2,3,4,5,6,7"

### Answer

## tougher problem

//        1       ----> print
//     /     \
//    2       3   <---- print
//   / \     / \
//  4   5   6   7 ----> print
//      .  .  . 
//
//
// 1) create the node type
// 2) write a function to print tree by level 
// ie. print "1, 3,2, 4,5,6,7, 15,14,13,12,11,10,9,8"