If right subtree is not empty , print right subtree
if ( root != n - 1 ) { ar = new int [ n - ( root + 1 ) ] ; Array . Copy ( in1 , root + 1 , ar , 0 , n - ( root + 1 ) ) ; int [ ] ar1 = new int [ n - ( root + 1 ) ] ; Array . Copy ( pre , root + 1 , ar1 , 0 , n - ( root + 1 ) ) ; printPostOrder ( ar , ar1 , n - root - 1 ) ; }