Interested to Buy Any Domain ? << Click Here >> for more details...
Which data structure is needed to convert infix notations to
post fix notations?
- 20 Answers
- 44289 Views
- Fidelity, Infosys, I also Faced
- E-Mail Answers
Answer Posted / aditya
stack since conversion frm regular to postfix and similarly
frm regular to infix is based on stack concept so its a
stack aplication
| Is This Answer Correct ? | 10 Yes | 4 No |
Post New Answer View All Answers
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
What is list data structure?
What is the complexity of sorting algorithm?
Can you please explain the difference between array_name and &array_name?
What is the best case time complexity of bubble sort?
Which language is best for data structures and algorithms?
Explain the steps to insert data into a singly linked list?
What are all the classes and interfaces that are available in the collections?
List the abstract operations in the set?
What are the differences between b tree and b+ tree?
What is the space complexity of bubble sort?
Why do we Use a Multidimensional Array?
How can we delete any specific node from the linked list?
What is a B tree?
What do you mean by 2-3-4 tree?
