This Repository contains the core concepts and implementation of Data Structures & Algorithms which include arrays, linked list, queues , stacks ,binary trees, BST, AVL Trees, sorting techniques and general operations

While we use infix expressions in our day to day lives. Computers have trouble understanding this format because they need to keep in mind rules of operator precedence and also brackets. Prefix and Postfix expressions are easier for a computer to understand and evaluate. Given two operands a and b and an operator \odot , the infix notation impli…

Reverse the infix string. Note that while reversing the string you must interchange left and right parentheses. Obtain the postfix expression of the infix expression Step 1.Reverse the postfix expression to get the prefix expression

Infix Expression Operations | Collaborated on this Project with @Jay9874

A GPLv3 C library for converting infix expressions to prefix expressions (Polish notation)

Django Website to Convert infix Expression to Postfix/Prefix Expression. Also Evaluate Postfix/Prefix Expression.

Algorithms for some useful Linear and Non-Linear Data Structures written in C programming language.