stack...since the operator last placed must be retrieved first.

Which data structure is needed to convert infix notations to
post fix notations?

Question Posted / naresh

Answer Posted / naresh

stack...since the operator last placed must be retrieved
first.

Is This Answer Correct ?

23 Yes

5 No

Please Help Members By Posting Answers For Below Questions

Define level of the tree?

966

Are hash tables ordered?

896

Describe queue operation.

970

Explain the internal working of a hash map?

964

What is indexing an array?

1056

Why is quicksort unstable?

943

Write any two principles of gradation of structures.

981

Can treeset have duplicates?

904

Why is hashing used?

852

What are priority queues?

963

We know that Arrays are objects so why cannot we write strArray.length()?

1607

Define left-in threaded tree?

854

What is the complexity of selection sort?

835

What is a reverse linked list.

1027

What are different types of algorithms?

891