In a binary tree, what is the term used for a node that has no children?
Think about the nodes at the very end of the tree branches.
A leaf node is a node that does not have any children. It is at the end of a branch in the tree.
What does the height of a binary tree represent?
Height measures the longest distance from the top to the bottom of the tree.
The height of a binary tree is the number of edges on the longest path from the root node down to the farthest leaf node.
Consider a node in a binary tree that has exactly two children. What is the correct term for this node?
This node is not at the end of a branch and has children.
An internal node is any node in a binary tree that has at least one child. A node with two children is an internal node.
Which statement correctly describes the difference between the depth and height of a node in a binary tree?
Think about how far a node is from the top and how far it is from the bottom.
Depth measures how far a node is from the root (top), while height measures how far it is from the farthest leaf (bottom).
What is the total number of nodes in a perfect binary tree of height 3?
A perfect binary tree has all levels fully filled. Use the formula for total nodes: 2^(height+1) - 1.
For height 3, total nodes = 2^(3+1) - 1 = 2^4 - 1 = 16 - 1 = 15 nodes.