# For implementing the recursive algorithm which data structure is used?

(B) Binary tree
(C) Queue
(D) Stack

### Related Posts 👇

• Which of the following statement is NOT correct about find operation?

(A) It is not a requirement that a find operation returns any specific name, just that finds on two elements return the same answer if and only if they are in the same set
(B) One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can be used to name the set
(C) Initially each set contains one element
(D) Initially each set contains one element and it does not make sense to make a tree of one node only

• Which of the following statement is correct about find(x) operation?

(A) A find(x) on element x is performed by returning exactly the same node that is found
(B) A find(x) on element x is performed by returning the root of the tree containing x
(C) A find(x) on element x is performed by returning the whole tree itself containing x
(D) A find(x) on element x is performed by returning TRUE

• What is the best definition of a collision in a hash table?

(A) Two entries are identical except for their keys
(B) Two entries with different data have the exact same key
(C) Two entries with different keys have the same exact hash value
(D) Two entries with the exact same key have different hash values