binary tree print

Write a function to print all elements of a binary tree starting at the furthest depth to up. At the furthest depth print all elements from righ tot left node & backwards. At second furthest level print the elements print elements from left to right. The 3rd furthest right to left and 4th furthest left to right. Use attached file for input. Out put should be 28,21,17,12,8,3,-2,-8,-5,5,15,25,20,0,10