[筆記]ch8

1.The height of tree is the level of the leaf in the
longest path from the root plus 1; the height of
an empty tree is -1.

2.A tree can be defined recursively as a set of
nodes that either (1) is empty or (2) has a
designated node called the root from which
hierarchically descend zero or more subtrees,
which are also trees.

3.In a linear list, each element has a unique
successor.

4.Four common operations are associated with linear
lists: insertion, deletion, retrieval, and traversal

5.Linked list: List in which each entries are
linked by pointers
– Head pointer: Pointer to first entry in list
– NIL pointer: A “non-pointer” value used to
indicate end of list

6.In the breadth-first approach, you process all
nodes in a level before proceeding to the next
level.

7
.Immediate addressing: Instruction contains
the data to be accessed
‧ Direct addressing: Instruction contains the
address of the data to be accessed
‧ Indirect addressing: Instruction contains the
location of the address of the data to be
accessed