Class to print the inorder traversal
public class BinaryTree { public Node root ; public virtual void inorder ( ) { if ( root == null ) { return ; } Stack < Node > s = new Stack < Node > ( ) ; Node curr = root ;