Prototype: implement prototype(Tree tree) returning List<List<String>> with a direct baseline.
Final: implement solve(Tree tree) with the mechanism and bounds described above. Input is null or a finite tree of immutable Tree records with unique names and no shared children. Return one fresh list per depth, in structural left-to-right order. Null input returns an empty list. Both stages have the same observable contract. The prototype may use the simpler method; final must use the target data structure.
The supplied nested record types define the API. All methods are static members of Exercise.
Drag or use the arrow keys to resize. Home collapses the question; End collapses the editor. Enter or double-click resets the split.
Loading editor…
Loading editor…
No results yet.
Complete the starter code, then run the checks.
Results and errors will appear here.
Java runs on this device with CheerpJ 4.3.