Binary Trees IB

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

• 35

• 24

• 42

• 20

Answer explanation

The ROOT node value is the topmost value in the Tree. In this case, the correct value is 35, as it is the only option that represents the ROOT node correctly.

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./

Answer explanation

The correct answer is 'the starting node in a rooted tree structure from which all other nodes branch off.' This defines the root as the primary node in a tree, from which all other nodes extend.

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

Answer explanation

A binary tree is defined as a tree structure where each node can have at most two child nodes. This distinguishes it from other tree types and aligns with the correct answer choice.

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

Answer explanation

In preorder traversal, the first step is to visit the root node. The second step is to traverse the left subtree before moving on to the right subtree, making 'traverse the left subtree' the correct choice.

How many leaf are there in the tree?

• 1

• 3

• 4

• 7

Answer explanation

The tree has 3 leaves, which can be counted by examining the branches. The other options (1, 4, and 7) do not match the actual count of leaves present.

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"

Answer explanation

The value '7' is greater than '6' but less than '15', so it should be placed on the right 'leaf' of '6'. This maintains the binary search tree property where left children are smaller and right children are larger.

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

Answer explanation

The In-Order traversal method visits nodes in the order of left child, parent, and then right child. This results in the nodes of a binary tree being output in ascending order, making it the correct choice for this question.

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

Answer explanation

The correct answer is Pre-, In- and Post-order, which are the standard depth-first traversal methods for trees. Pre-order visits the root first, In-order visits nodes in sorted order, and Post-order visits the root last.

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

• 
• 
• 

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

• 
• 
•