Skip to main content
Recursion and trees 0 of 6 activities solved
  1. Recursion and Trees Not yet read
  2. Recursion and Trees: quiz Not yet read
  3. Define Data Not yet solved
  4. Debug Tree Not yet solved
  5. Fill Tree Not yet solved
  6. Evaluate Operator Not yet solved
Next series Dictionaries
Recursion and trees

Fill Tree

Sign in to hand in your solution and get feedback.

from dataclasses import dataclass @dataclass class Corgi: name: str height: int coat_color: str @dataclass class Tree: pass EMPTY = Tree() @dataclass class FamilyTree(Tree): corgi: Corgi mother: Tree father: Tree def stack_yellow_corgis(family: Tree) -> int: if ___ == ___: return ___ mother_height_total = ___(___.___) father_height_total = ___(___.___) total_height_from_parents = ___ + ___ if ___.___.___ == "___": return total_height_from_parents + ___.___.___ else: return total_height_from_parents ada = Corgi("Ada", 20, "yellow") grace = Corgi("Grace", 30, "yellow") alan = Corgi("Alan", 25, "yellow") don = Corgi("Don", 15, "mixed")