Morris遍历

Morris遍历

时间复杂度O(N),空间复杂度O(1)

遍历规则：

• 如果cur无左孩子，cur向右移动
• 如果cur有左孩子，找到cur左子树上最右的节点，记为mostRight
  1. 若mostRight的右指针指向为空，让其指向cur，cur向左移动
  2. 若mostRight的右指针指向cur，让其指向NULL，cur向右移动

//先序遍历：在第一次访问节点的时候打印
void morrisPre(Node *head)
{
    if (!head)  return ;

    Node *cur = head;
    Node *mostRight = NULL;         //存放左子树的最右节点

    while (cur)
    {
        mostRight = cur->left;
        if (mostRight)
        {
            while (mostRight->right && mostRight->right!=cur)
            {
                mostRight = mostRight->right;
            }

            if (mostRight->right == NULL)   //第一次访问到cur
            {
                //
                cout << cur->val << " ";
                //

                mostRight->right = cur;
                cur = cur->left;
                continue;
            }
            else{
                mostRight->right = NULL;
            }
        }
        else{           //没有左子树，第一次访问到cur
            cout << cur->val << " ";
        }


        cur = cur->right;
    }
}

//中序遍历
void morrisIn(Node *head)
{
    if (!head)  return ;

    Node *cur = head;
    Node *mostRight = NULL;
    while (cur)
    {
        mostRight = cur->left;
        if (mostRight)
        {
            while (mostRight->right && mostRight->right!=cur)
            {
                mostRight = mostRight->right;
            }

            if (mostRight->right == NULL)
            {
                mostRight->right = cur;
                cur = cur->left;
                continue;
            }
            else{
                mostRight->right = NULL;
            }
        }

        cout << cur->val << " ";        //当要走向右节点的时候打印
        cur = cur->right;
    }
}

//后序遍历
void morrisPost(Node *head)
{
    if (!head)  return;

    Node *cur = head;
    Node *mostRight = NULL;
    while (cur)
    {
        mostRight = cur->left;
        if (mostRight)
        {
            while (mostRight->right && mostRight->right != cur)
            {
                mostRight = mostRight->right;
            }

            if (mostRight->right == NULL)
            {
                mostRight->right = cur;
                cur = cur->left;
                continue;
            }
            else{
                mostRight->right = NULL;
                printEdge(cur->left);           //当第二次来到cur时，打印cur左子树的右边界
            }
        }

        cur = cur->right;
    }

    printEdge(head);          //单独打印整棵子树的右边界
}

Node* reverseEdge(Node *head)
{
    Node *pre = NULL;
    Node *next = NULL;

    Node *cur = head;
    while (cur)
    {
        next = cur->right;
        cur->right = pre;
        pre = cur;
        cur = next;
    }

    return pre;
}

void printEdge(Node *head)
{
    Node *tail = reverseEdge(head);
    Node *tmp = tail;
    while (tmp)
    {
        cout << tmp->val << " ";
        tmp = tmp->right;
    }

    reverseEdge(tail);
}