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
- 43636 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
There is a program which inserts and deletes node in a sorted singly linked list. There is a bug in one of the modules, how would you debug it?
how to insert a new node in linked list where free node will be available?
Can we put null value in hashmap?
How many types of data structures are used?
What is indexing an array?
Is linkedlist thread safe?
Can tuple be sorted?
When ArrayIndexOutOfBoundsException occurs?
What is meant by binary tree traversal?
Which interfaces are implemented by enumset?
What method removes the value from the top of a stack?
Why arraylist is not efficient for manipulation?
Explain Array of pointers?
Can we null keys in treemap?
State the merits of linear representation of binary trees?
