Algorithm for Inorder Tree Traversals : Recursive Way

//Inorder Tree Traversals : Recursive class BinaryTreeInOrderTraversalR {      class TreeNode {             TreeNode left, right;             int data; // considering integer data.                    public TreeNode(int dataItem) {                   this.data = dataItem;                   left = null;                   right = null;             }      }              TreeNode root;        BinaryTreeInOrderTraversalR() {              root = null;        }               void printInOrderTraversal(TreeNode treeNode) {              if(treeNode == null)                     return;                           //Left, Data, Right              printInOrderTraversal(treeNode.left);              System.out.println(treeNode.data);              printInOrderTraversal(treeNode.right);        }               void printInOrder() {              printInOrderTraversal(root);        }        public static void main(String[] args) {              BinaryTreeInOrderTraversalR tree = new BinaryTreeInOrderTraversalR();              tree.root = new TreeNode(1);                      tree.root.left = new TreeNode(2);              tree.root.right = new TreeNode(3);                      tree.root.left.left = new TreeNode(4);              tree.root.left.right = new TreeNode(5);                      tree.root.right.left = new TreeNode(6);              tree.root.right.right = new TreeNode(7);                      tree.printInOrder();        } } //Time Complexity: O(n). Space Complexity: O(n).

Thanks..!!