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

精读《算法 - 二叉搜索树》 #337

Closed

ascoders opened this issue Jul 17, 2021 · 0 comments

Owner

ascoders commented Jul 17, 2021 •

edited

二叉搜索树是一个特殊二叉树，满足任意根节点大于左树，且小于右树。注意并不是大于左节点，而是大于整颗左树，这样对于任意一个元素的查找，都可以使用二分法将时间复杂度降低为 logn。

本周我们就来探讨二叉搜索树的相关性质与题目。

精读《算法 - 二叉搜索树》

ascoders closed this as completed

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