Data Structures - Tree

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

• Fruit 
• Leaf Node
• Root Node
• Nodes

A Kind of tree where every node in a tree can have at most two children.

• Binary Tree
• Binary Expression Tree
• Tree
• Binary Search Tree

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

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

The decision tree structure begins at a node called the _____.

• span

• top

• root

• branch

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"