Infix expressions evaluated in DSA?

How can we evaluate infix expressions in Data Structures and Algorithms (DSA)?