1/31

Question 1

Tree vs Graph

Answer 1

Tree: each node has only one parent. Root node is ancestor of all nodes.

Graph or cycle: node can have multiple parents

Question 2

Binary Tree

Answer 2

Each node has up to 2 children.

Question 3

Edges

Answer 3

Nodes are connected by edges.
A tree with n nodes has n-1 edges

Question 4

Level

Answer 4

Represents a node’s heirarchy

Question 5

Root

Answer 5

Single node at the top level

Question 6

Children

Answer 6

The nodes at each successive level of a tree ate the children of the nodes at the previous level

Question 7

Parent

Answer 7

A node that has children is the parent of those children

Question 8

Leaf

Answer 8

A node that has no children

Question 9

Subtree

Answer 9

Any node and its descendants form a subtree of the OG tree. Must include all descendants.

Question 10

Interior node

Answer 10

Non-leaf nodes (parent and has children)

Question 11

Class

Answer 11

A data structure where all instances share the same attributes and uses

Question 12

What is the point of OOP

Answer 12

We do not have to change the code every time we want to add/remove a similarly structured “object”. This is why we have classes for REUSABILITY.