implementing built-in data types about none type numeric types sequences canopy reference chaining chainmaps about advantage child circular buffer circular list about elementsappending elementsdeleting iterating through class methods classes co-routines coin counting problem collections module about data type comparison operators complexity classes about composing np-complete np-hard pversus np complexity curves conceptsgraphs adjacency degree of vertices edge loop node path vertex conceptstrees child degree depth edge height leaf node level node parent root node sibling sub tree counter objects data encapsulation data preprocessing data structures data visualization about bar chart box plot bubble chart multiple bar charts pie chart defaultdict object degree degree of vertex depth first traversal about in-order traversaland infix notation post-order traversaland postfix notation pre-order traversaland prefix notation depth-first search deques about advantages deterministic algorithms versus nondeterminstic algorithms deterministic selection about median of medians partitioning step pivot selection