Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.

#python #sicp

Partition trees. Trees can also be used to represent the partitions of an integer. A partition tree for n using parts up to size m is a binary (two branch) tree that represents the choices taken during computation. In a non-leaf partition tree:

  • the left (index 0) branch contains all ways of partitioning n using at least one m ,
  • the right (index 1) branch contains partitions using parts up to m-1 , and
  • the root value is m .
If you want to change selection, open document below and click on "Move attachment"


statusnot read reprioritisations
last reprioritisation on suggested re-reading day
started reading on finished reading on



Do you want to join discussion? Click here to log in or create user.