why doesn't the code work on right part of tree?

Idea is to swap Binary tree's element's with it's left node. Here's the code I came up with:

Code:

---


TREE swap_left (TREE T){
element_type tmp;
          if(T!=NULL){
        if(T->left){
        tmp = T->element;
        T->element = T->left->element;
        T->left->element = tmp;       
        T = T->left;
          }
          return (swap_left(T->right)&& swap_left(T->left));       
    }       
              return T;
}

---

when I print elements, Elements left to node are swapped but not right....please help in fixing this.

Well . . . it seems like all your code does is swap the left. You never manipulate the right at all. I don't really understand how you could expect the right to be modified. If this is your intention:

Quote:

---

Idea is to swap Binary tree's element's with it's left node.

---

then what does the right side of the tree have to do with it?