A utility function to print Inorder traversal of a Binary Tree
static void inorder ( Node root ) { if ( root != null ) { inorder ( root . left ) ; Console . WriteLine ( root . data + " ▁ " ) ; inorder ( root . right ) ; } }