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

leetcode-94-Binary Tree Inorder Traversal (Morris traversal) #1

Open

xxks-kkk opened this issue Apr 2, 2017 · 0 comments

Labels

todo

Owner

xxks-kkk commented Apr 2, 2017

Understand and implement second solution using morris traversal, which doesn't use stack.

https://leetcode.com/problems/binary-tree-inorder-traversal/#/description

See the solution: https://discuss.leetcode.com/topic/24683/o-n-solution-with-o-1-space-using-morris-traversal

xxks-kkk added enhancement todo labels

xxks-kkk removed the leetcode label

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