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.
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
二叉查找树rank方法错误 #1200
Comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
其中
if (x == null) return 0;
应该返回-1;否则和树中rank为0的第一个节点无法区分
The text was updated successfully, but these errors were encountered: