Register

Time complexity

• recategorized by
1,630 views
2 votes
2 votes
What is time complexity to evaluate prefix and postfix expression ? as per me it should be O(n) as  atmost 2 pop operation perform and 1 push operation
• recategorized by
User Avatar

1 Answer

0 votes
0 votes
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
2
jugnu1337 asked Apr 20, 2022
473 views
time complexity
what is T.C. of this code: for(i=1;i<=n;i++) for(j=1;j<=n;j=j+i) x=x+1;
what is T.C. of this code: for(i=1;i<=n;i++) for(j=1;j<=n;j=j+i) x=x+1;
User Avatar
1 votes
1 votes
1 answer
3
arya_stark asked Jul 4, 2018
21,030 views
Asymptotic time complexity to add a node at the end of singly linked list.
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? (a) O(1) (b) O(n) (c) θ (n) (d) θ (1) Confused between option (b) and (c) .
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?(a) O(1) (b...
User Avatar
0 votes
0 votes
1 answer
4
iarnav asked Jun 12, 2018
872 views
#DataStructure Time Complexity in Sorted Array.
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
User Avatar
Link Copied!