Depth First Search uses data structure. O a. Stack O b. Array O c. Queue O d. Linked List Identify the algorithm and then choose an appropriate option given below. void ABCOrder(node root) { if(root!=NULL) { coutinfo; ABCOrder(root->left); ABCOrder(root->right); } } a. postOrder Traversal O b. Binary Traversal O c. inOrder Traversal O d. preOrder Traversal Nodes that are not having any child are called as_ a. External Node O b. Terminal Nodes O c. Leaf Node O d. All of the above