11.1

Question 1

What is a tree

Answer 1

A connected undirected graph with no simple circuits

Question 2

When is an undirected graph a tree

Answer 2

if and only if there is a unique simple path between any two of its vertices

Question 3

Difference between m-ary tree and full m-ary tree

Answer 3

m-ary: if every internal vertex has no more than m children
full m-ary tree: if every internal vertex has exactly m children

Question 4

How many edges does a tree with n vertices have

Answer 4

A tree with n vertices has n-1 edges

Question 5

How many vertices does a full m-ary tree with i internal vertices have

Answer 5

n = mi+1