Trees - Part 2

The video tutorial explains the concepts of depth and height in tree structures. Depth is defined as the length of the path from the root node to a specific node, while height is the number of edges in the longest path from a node to a leaf node. The tutorial also covers the height of a tree, which is the height of the root node, and discusses inner nodes and edges. Diagrams are used to aid understanding, and the video concludes with a brief introduction to binary trees.

What is the depth of a node in a tree?

• The number of edges from the node to a leaf node

• The number of edges from the root node to the node

• The total number of nodes in the tree

• The number of leaf nodes in the tree

What is the depth of the root node in a tree?

• 1

• 0

• Equal to the number of leaf nodes

• Equal to the height of the tree

How is the height of a node defined?

• The total number of nodes in the tree

• The number of leaf nodes in the tree

• The number of edges in the longest path from the node to a leaf node

• The number of edges from the node to the root node

What determines the height of a tree?

• The number of leaf nodes

• The height of the root node

• The number of inner nodes

• The total number of nodes

Which of the following is true about the height of a tree?

• It is the depth of the deepest leaf node

• It is the number of leaf nodes

• It is the height of the root node

• It is always equal to the number of nodes

What is an inner node in a tree?

• A node that is not a leaf node

• A node that is the root

• A node with only one child

• A node with no children

How can you calculate the number of edges in a tree?

• By counting the number of leaf nodes

• By subtracting one from the number of nodes

• By counting the number of inner nodes

• By adding one to the number of nodes