@@ -0,0 +1,784 @@
+package data_structures.trees;%0D%0A%0D%0A/*%0D%0A * Problem Statement: %0D%0A * You are given a pointer to the root of a binary tree; print the values in%0D%0A * in-order traversal.%0D%0A * %0D%0A * You only have to complete the function.%0D%0A * %0D%0A * Input Format:%0D%0A * You are given a function,%0D%0A * %0D%0A * void Inorder(node *root) %7B%0D%0A * %0D%0A * %7D%0D%0A * %0D%0A * Output Format:%0D%0A * Print the values on a single line separated by space.%0D%0A * %0D%0A * Sample Input: %0D%0A *      3%0D%0A *    /   %5C%0D%0A *   5     2%0D%0A *  / %5C   /%0D%0A * 1   4 6%0D%0A * %0D%0A * Sample Output: %0D%0A * 1 5 4 3 6 2%0D%0A */%0D%0Apublic class InorderTraversal %7B%0D%0A%0D%0A%09void Inorder(Node root) %7B%0D%0A%09    %0D%0A%09    if (root.left != null) %7B%0D%0A%09        Inorder(root.left);%0D%0A%09    %7D%0D%0A%09    System.out.print(root.data + %22 %22);%0D%0A%09    if (root.right != null) %7B%0D%0A%09        Inorder(root.right);%0D%0A%09    %7D%0D%0A%09%7D%0D%0A%7D

Add InorderTraversal