help with AVL tree

hi,could somebody help me to make a AVL tree in C language?

it needs to do the following functions:

search, add, delete, inorder, postorder, preorder

>>1
Search, in order, pre order, and post order are the same in all binary trees. Only insert and delete are different.

There, I answered 2/3 of your question.