Inorder Traversal
Submissions: 18125   Accuracy:

60.29%

  Difficulty: Basic   Marks: 1

Given a binary tree, print inorder traversal of it. Inorder traversal of below tree is 5 10 1 39

        1
     /      \
   10      39
  /
5

Input Format:
The task is to complete the method which takes one argument, root of Binary Tree. The struct Node has a data part which stores the data, pointer to left child and pointer to right child.
There are multiple test cases. For each test case, this method will be called individually.

Output Format:
For each testcase, in a new line, print the inorder traversal.

Your Task:
You just need to complete the function inorder that takes node as parameter.

Constraints:
1 <= T <= 100
1 <= Number of nodes <= 100
1 <= Data of a node <= 1000

Example:
Input:

2
2
1 2 R 1 3 L
4
10 20 L 10 30 R 20 40 L 20 60 R

Output:
3 1 2
40 20 60 10 30

Explanation:
Testcase1: The tree is
        1
     /      \
   3       2
So, the inorder would be 3 1 2
Testcase2: The tree is
                           10
                        /        \
                     20         30
                  /       \
               40       60
So, the inorder would be 40 20 60 10 30

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harshit Sidhwa
Author: kartik


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.

to report an issue on this page.