Convert the following infix expression to post fix notation
((a+2)*(b+4)) -1
- 9 Answers
- 18407 Views
- I also Faced
- E-Mail Answers
Answer Posted / arun chowdary g
a2+b4+*1- is correct because in postfix traversals are from
left, right and then root.
| Is This Answer Correct ? | 37 Yes | 4 No |
Post New Answer View All Answers
State the difference between stacks and linked lists?
State the demerit of linear representation of binary trees?
Will it create any problem if we add elements with key as user defined object into the treemap?
Write the recursive c function to count the number of nodes present in a binary tree.
What is ds heap sort?
Differentiate between iterable and iterator.
What type of data structure is used to perform recursion?
Does hashmap maintain insertion order?
Provide an algorithm to reverse a linked list without using recursion.
What is frozenset?
How does a hashtable work?
How do hash tables work?
Explain Queue
What is the time complexity of hashmap get () and put () method?
What is a threaded binary tree? Explain its operation with example?
