Helper function to test mirror ( ) . Given a binary search tree , print out its data elements in increasing sorted order .
void inOrder ( Node node ) { if ( node == null ) return ; inOrder ( node . left ) ; System . out . print ( node . data + " ▁ " ) ; inOrder ( node . right ) ; }