Which data structure is needed to convert infix notations to
post fix notations?
Answer Posted / selate
STACK
Is This Answer Correct ? | 33 Yes | 8 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 sorting explain?
Can you change size of array once created?
What is difference between array and arraylist? When will you use array over arraylist?
What are the advantages of linked list?
What is the Difference between treemap and hashmap?
What is frozenset?
Is heap sort faster than quicksort?
Which language is best for learning data structures and algorithms?
What is an array vs list?
Different Types of pattern?
What is the height of a binary tree?
What are the applications of stack?
What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?
Does mentioning the array name gives the base address in all the contexts?