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