#EC352
Linear lists: are lists with a last element that is not connected to anything.

node with degree 0 is the root node

Stacks and Queues can be implemented using Linked Lists

in trees, the degree of a node is:

in trees, the "height" starts from the leaf nodes and counts up, the "level" however starts from the root and counts down, both counting from 0...

which of the following do we use to turn any tree into a binary tree

an example of a "Scalar" data structure is...