- 1 Convert The Infix Expression To Postfix Expression Using Stack Explain In Details 3marks 11 2 1 3 3 2 2 3 2 1 (34.23 KiB) Viewed 54 times
1. Convert the infix expression to Postfix expression using Stack. Explain in details (3marks) 11 +2 -1 * 3/3 + 2^ 2/3 2
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
1. Convert the infix expression to Postfix expression using Stack. Explain in details (3marks) 11 +2 -1 * 3/3 + 2^ 2/3 2
1. Convert the infix expression to Postfix expression using Stack. Explain in details (3marks) 11 +2 -1 * 3/3 + 2^ 2/3 2. Find the big notation of the following function? (1 marks) f(n) = 4n? - 2n° + n- 3. 3. Using an in-order traversal, what are the orders of the nodes in the following Tree (2marks). 8 10 13 4. What are the differences between linear search and binary search? (1 mark) 5. Build a heap from the following array-draw each step (3 marks) 11 4 10 2 9 5 8 3 7 06
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!