New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

二叉树遍历-速记法 #8

Open

chaojun-zhang opened this issue Feb 2, 2020 · 0 comments

Labels

Leetcode 二叉树

Owner

chaojun-zhang commented Feb 2, 2020 •

edited

Loading

先序遍历

栈S;
p= root;
while(p不空 || S不空){
    while(p不空){
        访问p节点；
        p的右子树入S;
        p = p的左子树;
    }
    p = S栈顶弹出;
}

后序遍历

栈S;
p= root;
while(p不空 || S不空){
    while(p不空){
        访问p节点；
        p的左子树入S;
        p = p的右子树;
    }
    p = S栈顶弹出;
}
结果序列逆序;

中序遍历

栈S;
p= root;
while(p不空 || S不空){
    while(p不空){
        p入S;
        p = p的左子树;
    }
    p = S栈顶弹出;
    访问p;
    p = p的右子树;
}

chaojun-zhang added Leetcode 二叉树 labels

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment