Code2begin.blogspot.com Website Review

this post is about conversion of infix expression to prefix conversion. for this conversion we take help of stack data structure, we need to push and pop the operators in and out of the stack. this method is very similar to the method that we used to convert infix to postfix but the only difference is that here we need to reverse the input string before conversion and then reverse the final output string before displaying it.. note: this changes one thing that is instead of encountering the opening bracket we now first encounter the closing bracket and we make. so, to convert an infix expression to a prefix expression we follow the below steps (we have 2 string, 1st is the input infix expression string 2nd is the output string which is empty initially) hashing is a technique used for storing , searching and removing elements in almost constant time. hashing is done with help of a hash function that generates index for a given input, then this index can be used to search the elements, store an element, or remove that a hash function is a function that is used to map the data elements to their position in the data structure used. for example if we use an array to store the integer elements then the hash function will generate position for each element so that searching, storing and removing operation on the array can be done in constant time that is independent of the number of elements in the array. for better look at now we face a problem if for 2 numbers same position is generated example consider elements 1 and 14 so when we get 1 we store it at the first position, but when we get 14 we see that the position 1 is already taken, this is a case of