Tree: Preorder Traversal Hackerrank Java

Tree: Preorder Traversal Hackerrank Java

  March 25, 2017    

---

/* you only have to complete the function given below.
Node is defined as

class Node {
    int data;
    Node left;
    Node right;
}

*/

void preOrder(Node root) {
    if(root instanceof Node)
        {
System.out.print(root.data+" ");
    preOrder(root.left);
    preOrder(root.right);
    }
}

EXPLANATION :

Here we are using instanceof to check whether root is valid entry or not 

After that a recursive call to the function so that it traverse in preorder

Reference

http://www.javatpoint.com/downcasting-with-instanceof-operator