Intellectual Olympiad in Algorithms and Programming Fundamentals - 2026 ongoing
1000 ₸
Subject: Algorithms and Programming Fundamentals Level: X (I is easiest, XII is hardest)
Category: student
Question language: English
Questions: 15
Example question: 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)