C++中map、set、multimap，multiset的底层实现 #2943

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

Open

wjm-lzy opened this issue May 23, 2025 · 0 comments

wjm-lzy commented May 23, 2025

C++中map、set、multimap，multiset的底层实现都是基于红黑树的，红黑树和二叉平衡搜索树有很大区别的，尤其是在保持平衡这个方面

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