d$.(8$ pts$)$ Give the correct choice: True or False?

A$.$ In a binary tree, if the depth and height of a node are the same,

then it is the root node. Answer:

B$.$ Insert and remove operations can be done by pointer updates in a

linked list. Answer:

C$.$ Arrays are more advantageous than linked lists to reach the value

of an element. Answer:

D$.$ When we create a linked list, we have pointer to the last element

of the list. Answer: