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

Exercises 12.1-3 Add second algorithm(nonrecursive and no stack) #316

Open

Akasakar opened this issue Jan 14, 2020 · 0 comments

Akasakar commented Jan 14, 2020

problem: a more complicated but elegant solution that uses no stack but assumes that two point- ers can be tested for equality.

how to solve the other way
you can see Morris Traversal

Morris Inorder Tree Traversal
二叉树的非递归遍历（不用栈、O(1)空间）

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