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
- 44324 Views
- Fidelity, Infosys, I also Faced
- E-Mail Answers
Answer Posted / mehdi
stack
| Is This Answer Correct ? | 3 Yes | 5 No |
Post New Answer View All Answers
Define depth and height of a tree?
How do you replace an element in an arraylist?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
Can you sort a hashmap?
What is the difference between dictionary and hashtable?
What is circular linked list?
What is integer max_value?
How can you correct these errors?
What is the method to find the complexity of an algorithm?
What is linked hash set?
What is the use of sorting?
Is vector synchronized?
What is time complexity of hashmap?
What is a weighted graph?
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).
