Open the context
Choose the project folder and name the files or behavior involved.
Workflows
Coding workflows · Ordered full-tree shape counts
03
A concrete starting point
Count ordered full binary-tree shapes with zero to 100 internal nodes using exact integers. Test the single leaf and small known counts, rejecting Boolean or out-of-range inputs without constructing all trees.
Define the change
Describe the input, expected output and boundaries that must stay intact.
Inspect the work
Review the proposed edits and any commands before relying on their result.
Check the outcome
Compare actual behavior with the expected result. If a check fails, investigate it before applying more changes.
Ordered full-tree shape counts
A concrete starting point
def tree_shapes(internal_nodes):
if type(internal_nodes) is not int or not 0 <= internal_nodes <= 100:
raise ValueError("shapes.nodes")
counts = [1] + [0]*internal_nodes
for size in range(1, internal_nodes+1):
counts[size] = sum(counts[left]*counts[size-1-left] for left in range(size))
return counts[internal_nodes]
The example is a starting point for a real project, not a claim that generated code is already tested. Adjust paths, dependencies and expected behavior to match your application.