Swap the left and right subtrees of the binary tree (flip of the binary tree) __ Two fork Tree

For the binary tree, we must be proficient in its various operations, today we want to implement the two-fork tree flip, that is, swap left and right subtree. The specific idea is not difficult, if a node is a leaf node, then do not operate; If a node has only a left child or a right child, it is exchanged, the original child is empty; If a node has both a left child and a right child, the child is exchanged. Detailed code uploaded to Https://github.com/chenyufeng1991/ReverseLeftRightChild.

The core code is as follows:

Swap left
and right subtree void Reverseleftrightchild (Bitnode **t)
{
    //If leaf node, recursive End If
    (*t = = NULL)
    {
        return ;
    }

    Swap ((*t)->lchild, (*t)->rchild); It is convenient to use the SWAP function directly, direct exchange pointer,
    Reverseleftrightchild (& ((*t)->lchild));
    Reverseleftrightchild (& (*t)->rchild);
}