Linked list is declared as follows the complexity of the fol

Linked list is declared as follows: the complexity of the following C++ code segment? (Show your work.) will be the result If a postfix notation 7 8 6 5 - 4 +\" will be evaluated? will be the result if a postfix notation 7 8 4 6 5 + + \"will be evaluated? teems, enter a queue at its _ side, and items leave a queue from its_ side.

Solution

Node *cur=head; cur!=NULL, cur=cur->next

cout<<cur->item;

The complexity is O(n) as the for loop is present in method.

THe posttfix expression mention is wrong for both the cases.

in queue items enter at rear side and leaves from front side