MS 101 - Week 16 - Graph

What is the order of nodes visited for breadth-first traversal of this tree?

• ABCDEFG

• ABECFDG

• ABCEFDG

• ABECFGC

What is the order of nodes visited for depth-first traversal of this tree?

• ABCDEFG

• ABECFDG

• ABCEFDG

• ABECFGC

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

• Fruit 
• Leaf Node
• Root Node
• Nodes

What is the value of the ROOT node in this Tree?

• 35

• 24

• 42

• 20

Root

• data structure similar to a graph, with no loops.

• an object in a graph also known as a vertex

• a join of relationship between nodes - also know as an arc

• the starting node in a rooted tree structure from which all other nodes branch off./

Tree

• data structure similar to a graph, with no loops.

• an object in a graph also known as a vertex

• a join of relationship between nodes - also know as an arc

• the starting node in a rooted tree structure from which all other nodes branch off./

Binary TREE

• data structure similar to a graph, with no loops.

• an object in a graph also known as a vertex

• a join of relationship between nodes - also know as an arc

• a tree where each node can only have 2 child nodes attached to it

How many leaf are there in the tree?

• 1

• 3

• 4

• 7

A Balanced Tree has equal number of items on each subtree.

• True
• False

Which of the following sequences denotes the post order traversal sequence of the tree?

• f e g c d b a

• g c b d a f e

• g c d b f e a

• f e d g c b a