Please answer all questions

Q1:

in tree data structure, the nodes that share the same parent are called____.

-Descendents

-Leaves

-Ancestors

-siblings

Q2:

-Because stack operations are _______ operations, this is unlikely to yield any discetnable improvement excpt under very unique circumstances.

-variable-time

-O(n)

-Constant-time

-O(n log n)

Q3:

Any__________ implementation is legal for_____.

-List, queues

-Queue, stack

-Stack, queue

-List, arrays

Q4:

Which of the following is a fundamental operation for stack____________?

-enqueue

-dequeue

-pop

-rear

Q5;

in a simple Linked List, the insert method requires obtaining a new node from the system by using________.

-A new call and then executing two references maneuvers

-A new call and then executing three references maneuvers

-A call only

-A new call and then executing one references maneuvers