Please answer all qu

Q1: In the pop operation, for array implementation of stack, we set the return value to the Array[topOfStack] and the increment topOfStack.

True or false

Q2:The height of a binary tree is O(log N).

True or false

Q3: The pop operation of stack deletes the first inserted element

True or false

Q4:in tree, A path is a sequence of nodes such that the next code in the sequence is a sibling of the previous.

True or false

Q5:

pick the right answer

-when we compute the sum of the numbers in a list as the following code:

Public static int sum( List 1st )

{

Int total =0;

For( int I = 0; i < N; i++)

Total += 1st.get( i );

return total;

}

a-The running time is O(N) for a LinkedList

b-The running time is O(1) for a LinkedList

c- The running time is O(N²) for a LinkedList

d- The running time is O(log n) for a LinkedList