a) O(n) where n is the length of the equation
b) O(n) where n is number of operands
c) O(1)
d) O(logn) where n is length of the equation
The time complexity of converting a prefix notation to infix notation is _________
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
The time complexity of converting a prefix notation to infix notation is _________
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!