A utility function to print inorder traversal of a Binary Tree
static void printInorder ( Node node ) { if ( node == null ) return ; printInorder ( node . left ) ; Console . Write ( " { 0 } ▁ " , node . data ) ; printInorder ( node . right ) ; }