(Choose 1 answer)
Specify the correct implementation of in-order traverse algorithm for binary trees.
A. void inOrder(Node p){ inOrder(p.left); visit(p); inOrder(p.right); }
B. void inOrder(Node p){ if (p == null) { inOrder(p.left); visit(p); inOrder(p.right); } }
C. void inOrder(Node p){ if (p != null) { visit(p); inOrder(p.left); inOrder(p.right); }
D. void inOrder(Node p){ if (p != null) { inOrder(p.left); visit(p); inOrder(p.right); } }
Exit 15
