Expression Trees

Hi ,
i have been trying for few days to create a expression using c language.
i want to build a expression tree.

which should accept the input in infix form and using three traversal methods i want to print its all forms.

can some one help me out how to do this.

2.
is there any relationship between height and balancing tree.
if so how check a given tree is balanced based on height.


thanks,

Habiller

Look for in order traversal.