CS61A 18sp -- Lecture12 (Trees) 笔记

最新推荐文章于 2022-12-18 12:09:25 发布

吾乃皮皮兽啊

最新推荐文章于 2022-12-18 12:09:25 发布

阅读量316

点赞数

分类专栏： UCB CS61A

本文链接：https://blog.csdn.net/weixin_45461952/article/details/110307357

版权

本文详细介绍了树的数据结构，包括使用Box-and-pointer Notation表示列表和树，切片操作，处理容器值的方法如求和、最大值、全为真判断，以及树的描述、构造和递归处理。同时，提供了Fib树的构建和打印树的代码示例。

摘要由CSDN通过智能技术生成

Lecture12 Trees

1. Box-and-pointer Notation

Lists are represented as a row of index-labeled adjacent boxes, one per element
Each box either contains a primitive value or points to a compound value

eg.

'>>>pairs = [1, 2]

‘>>>nested_list = [ [1, 2], [ ], [ [3, False, None] , [4, lambda: 5 ] ] ]

2. Slicing
3. Processing Container Values

1.sum(iterable[, start]) -> value
解释：Return the sum of an iterable of numbers (NOT strings) plus the value of parameter ‘start’ (which defaults to 0). When the iterable is empty, return start.

>>> sum([2,3,4])
9
>>> sum([2,3],4)
9
>>> sum (['2', '3', '4'])
TypeError: unsupported operand type(s) for +: 'int' and 'str'
>>> sum([2, 3], [4])
TypeError: can only concatenate list (not "int") to list
>>> [2, 3]+[4]+ []
[2, 3,