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

Algorithm中序遍历的前驱后继结点算法 #187

Open

weihanlu opened this issue Mar 22, 2019 · 1 comment

weihanlu commented Mar 22, 2019

前驱结点此处或许应为
parent.right!==node 或 parent.left===node
同理后继结点算法也有类似问题

The text was updated successfully, but these errors were encountered:

ljscode commented Aug 19, 2019

后面while(node)好像也有问题？

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