算法与编程基础 - 2026 进行中

科目: 算法与编程基础
级别: X
类别: 大学生
测试题目: 英语
问题示例: For a red-black tree containing n internal nodes, which upper bound on its height h is guaranteed? h ≤ log₂(n + 1), h ≤ 3log₂(n + 1), h ≤ n/2, h < 2log₂(n + 1)