Question

Given the following code snippet, which operation is performed on the binary tree to produce the output: 4, 2, 5, 1, 3 ? class Node {       int data;      Node left, right;      Node( int value) {          data = value;          left = right = null ;      }  }    void traverse (Node root) {       if (root == null )           return ;      traverse(root.left);      System.out.print(root.data + " " );      traverse(root.right);  } 

A Preorder Traversal
B Postorder Traversal
C Inorder Traversal
D Level Order Traversal
E Depth First Traversal
Practice Next

Hey! Ask a query