Tree Data Structure

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

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

In preorder traversal of a binary tree the second step is ____________

• traverse the right subtree

• traverse the left subtree

• traverse right subtree and visit the root

• visit the root

How many leaf are there in the tree?

• 1

• 3

• 4

• 7

In this tree, where would the new value "7" be placed?

• On the left "leaf" of "4"
• On the right "leaf" of "6"
• On the left "leaf" of "15"
• Over the top of the current number "5"

Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?

• Pre-Order

• In-Order

• Post-Order

• Monastic Orders

What are the 3 depth traversals for a tree data structure?

• Pre-, In- and Post-order

• Pro-, In- and Past-order

• Pre-, Out- and Post-order

• Pre-, In- and New-order

When traversing a binary tree, which diagram is post-order?

• 
• 
• 

When traversing a binary tree, which diagram is pre-order?

• 
• 
•