We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
平衡二叉树的插入节点操作平均时间复杂度是()(2分)
A. O(N) B. O(N^2) C. O(N * log(N)) D. O(log(n))
你的回答C ,是错误的。应是D
The text was updated successfully, but these errors were encountered:
No branches or pull requests
平衡二叉树的插入节点操作平均时间复杂度是()(2分)
A. O(N)
B. O(N^2)
C. O(N * log(N))
D. O(log(n))
你的回答C ,是错误的。应是D
The text was updated successfully, but these errors were encountered: