Description
Valfria uppgifter som testar implementationer av (balanserade) binära sökträd med specifik signatur, se lydelserna.
Start & End Times
| Start Time | 2025-03-25 15:00 CET |
| End time | 2025-05-02 16:00 CEST |
Problems
| Label | Problem |
|---|---|
| A | Binary Search Tree Operations |
| B | Binary Search Tree Operations 2 |
Scoring
Partial Credit — Unranked
Explanation:
Each problem is scored, with partial credit possible. Participants are not ranked.
Results
- Results are shown without limitation.
Languages
Ada Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal C with GMP C++ with GMP C with Memory Check C++ with Memory Check D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Java with Algs4 Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Python 3 with NumPy Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig