Binary trees

In a binary tree a node (vertex) can only have one child.

• True

• False

• A,B

• B,C

• A,C

• A

• E

• C

• I

Draw a binary tree where A is the parent of B and C, B is a parent of D and E, E is a parent of F. G and H are children of C, and I and J are children of H.

On what level is J?

• Level 1

• Level 2

• Level 3

• Root

What expression is represented by the tree?

• $3+\left(\left(5+9\right)\cdot2\right)$

• $3+5+9\cdot2$

• $\left(3+5+9\right)\cdot2$

Evaluate:

• 31

• 26

• 34

• 28

The number of edges from the root to the node is called __________ of the node.

• Degree

• Length

• Path

• Depth

In a full binary tree...........................

• Each level has exactly 0 or 2 nodes

• All the leaves are at the same level

• Each node has exactly zero or two children

• Each level has exactly 2 nodes

A tree is composed of ____ connected by edges or lines.

• Nodes

• graphs

• stacks

• list

Inorder traversal

• Left Right Root

• Left Root Right

• Right Left Root

• Right Left Root