a(b(cd)e(fg))

a
                           /
                          b   e
                         /  /
                        c  d f  g

#include<stdio.h>
#include<malloc.h>
#include<string.h>

struct node
{
    char x;
    struct node *left;
    struct node *right;
}*root;

char a[30];
int i=0,n;

void tre(struct node * p) //function that I am using to convert the string to a tree
{
        if(a[i]=='(')
        {
            i++;
            struct node *temp=malloc(sizeof(struct node));
            temp->x=a[i];
            temp->left=temp->right=NULL;
            i++;
            if(p->left==NULL)
            {
                p->left=temp;
                tre(p->left);
            }
            if(a[i]!='('&&a[i]!=')')
            {
                struct node *tempp=malloc(sizeof(struct node));
                tempp->x=a[i];
                i++;
                p->right=tempp;
                tre(p->right);
            }
        }
        else
        if(a[i]==')')
        {
            i++;
        }

}

void inorder(struct node *p)//inorder traversal of the tree made
{
    if(p!=NULL)
    {
        inorder(p->left);
        printf("%c ",p->x);
        inorder(p->right);
    }
}

main()
{
    printf("Enter the string : ");
    scanf("%s",a);
    struct node *temp=malloc(sizeof(struct node));
    temp->x=a[i];
    temp->left=temp->right=NULL;
    i++;
    root=temp;
    tre(root);
    inorder(root);
}

char a[30];
int i=0,n;

typedef struct node
{
    char x;
    struct node *left;
    struct node *right;
} Node;

void tre(struct node * p) //function that I am using to convert the string to a tree

Node* tre(char const* input)  // potentially more parameters to deal with position.

Node* parseTree(char const* data, size_t* pos)
{
    if (data[(*pos)] == '')
    {   // Appropriate error msg
        exit(1);
    }

    // Allocate the tree here. (initialize all members)
    Node*   result  = malloc(sizeof(Node));
    result->value   = data[(*pos)++];
    result->left    = NULL;
    result->right   = NULL;

    // Now check for sub branches.
    if (data[(*pos)] == '(')
    {
        // Move past the '('
        (*pos)++;

        result->left    = parseTree(data, pos);
        result->right   = parseTree(data, pos);

        if ((*pos) != ')')
        {   // Appropriate error msg
            exit(1);
        }
        // Move past the ')'
        (*pos)++;
    }
    // Done.
    return result;
}
Node* buildTree(char const* data)
{
    if (data == NULL)
    {   // Appropriate error msg
        exit(1);
    }
    size_t  pos = 0;
    return parseTree(data, &pos);
}

a
                       /
                      b   e
                     /  /
                    c  d f  g

void tre(struct node * p) //function that I am using to convert the string to a tree
{
        if(a[i]=='(')
        {

i++;
            struct node *temp=malloc(sizeof(struct node));
            temp->x=a[i];
            temp->left=temp->right=NULL;

i++;
            if(p->left==NULL)

{
                p->left=temp;
                tre(p->left);
            }
            if(a[i]!='('&&a[i]!=')')

{
                struct node *tempp=malloc(sizeof(struct node));
                tempp->x=a[i];
                i++;
                p->right=tempp;
                tre(p->right);
            }

        }
        else
        if(a[i]==')')
        {
            i++;
        }

}

stuct node * tre()
{
     struct node * node = malloc(sizeof(struct node));
     node->x = a[i++];
     if(a[i] == '(')
     {
          node->left = tre();
          node->right = tre();
          assert(a[i++] == ')');
     }
     else
     {
          node->left = node->right = NULL;
     }
     return node;
}

a(b(cd)e(fg))

a
                          /
                         b   e
                        /  /
                       c  d f  g

#include <string.h>

int main(int argc, char *argv[])
{
    if(argc >= 2 && strcmp(argv[1], "a(b(cd)e(fg))") == 0)
        puts(
             "               a"     "n"
             "              / "    "n"
             "             b   e"   "n"
             "            /  / "  "n"
             "           c  d f  g" "n"
            );
    return 0;
}