Authoring skeleton - differentiated CS113 implementation

Short topic and PBL layers

Model ordered project records with binary-tree nodes, recursive traversal, and BST lookup. Compare with Spring collection/repository behavior; those services are not existing from-scratch BST examples.

Implementation layers to author

• Nodes and in-order traversal.
• BST insertion/search with an explicit duplicate-key policy.
• Deletion of leaves, one-child nodes, and two-child nodes.
• Week 35 comparison extension: 2-3-4 balancing and skip-list layers, with implementation depth based on readiness.

Evidence checklist to author

Test missing values, empty trees, root deletion, duplicate keys, and sorted versus mixed insertion. Explain height-dependent costs rather than guaranteeing logarithmic lookup for an unbalanced BST.

Publication checklist

Complete examples, a CodeRunner exercise, and tests before assigning courses.csa.week, removing draft/hide flags, or enabling submissions.

Code Runner Challenge

Authoring draft - tree exercise is not ready

View IPYNB Source

// CODE_RUNNER: Authoring draft - tree exercise is not ready
public class TreeDraft {
    public static void main(String[] args) {
        throw new UnsupportedOperationException("Draft: author tree invariants and tests before publication.");
    }
}
TreeDraft.main(null);

Python Java JavaScript Pseudocode 14px 16px 18px 20px

Lines: 1 Characters: 0

Output

Click "Run" in code control panel to see output ...