Tree: Inorder Traversal HackerRank Solution

Tree: Inorder Traversal HackerRank Solution
Source : https://www.hackerrank.com/challenges/tree-inorder-traversal

Complete the inOrder function in your editor below, which has parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values.

Input Format

Our hidden tester code passes the root node of a binary tree to your inOrder function.

Constraints

1 Nodes in the tree 500

Output Format

Print the tree's inorder traversal as a single line of space-separated values.

Sample Input

     1      \       2        \         5        /  \       3    6        \         4  

Sample Output

1 2 3 4 5 6 

Source : https://www.hackerrank.com/challenges/tree-inorder-traversal

Solution

	// Karthikalapati.blogspot.com
	/*
	Node is defined as
	class Node {
	int data;
	Node left;
	Node right;
	}
	*/
	void inOrder(Node n) {
	if (n != null) {
	inOrder(n.left);
	System.out.print(n.data + " ");
	inOrder(n.right);
	}
	}