a. Find the height of the tree with root 70 . b. Find the level of the node with info 75 . c. Li

A. Find the height of the tree with root 70 . b. Find the...

Key Concepts

Finding a Path Between Nodes

Finding a path between two nodes in a tree involves identifying a sequence of connected nodes from the starting node to the destination node. This may require determining the lowest common ancestor of the two nodes and then constructing the path through the tree from the starting node up to the common ancestor and down to the destination node.

Node Level

The level of a node indicates its distance from the root node, typically measured in terms of edges. The root node is usually considered to be at level 0 or level 1, and each subsequent level is incremented by one as you move further from the root.

Tree Height

Tree height is a measure of the longest path from the root node to a leaf node. It is commonly used to indicate the depth of the tree and is determined by identifying the maximum number of edges (or nodes, depending on the definition) along the path from the root to any leaf.

Transcript

00:01 Here we have a depiction of figure 8 .3 with labels for the nodes that are referenced in the question.

00:08 For part a, we're wondering which node is the root.

00:12 The root node of a tree is the one typically shown at the top, the one that doesn't have any parent nodes.

00:18 So that's this node up here, and that's called user, sorry, slash user slash rt slash courses.

00:35 Part b is what are the internal nodes.

00:38 Internal nodes of a tree are any that aren't leaf nodes.

00:43 Leaf nodes of this tree are shown in blue.

00:45 They're nodes that don't have any children.

00:50 So all of the internal nodes are all of the ones shown in black, including the root node that we just listed.

01:00 So you could list all those out, but they are just non -leaf nodes.

01:04 For part c, you're looking for the descendants of node cs016 right here.

01:18 Descendants of a node are any that can be drawn below that node.

01:22 So the children, which are these here, the children of those children, and so on and so forth if there were more here.

01:34 And in this tree, that totals up to nine descendants.

01:38 For part d, we're looking for the ancestors of the same node, which is almost the opposite of descendants.

01:47 So ancestors are any nodes that can be drawn above the node in question.

01:54 So any parents, parents of those parents, and so on.

01:58 In this case, it's just one, the root node here...

Please give Ace some feedback