binary trees

Question 1

What is the depth of a tree?

Answer 1

The depth of a tree is the maximum depth of any leaf node.

Question 2

What are the characteristics of a full binary tree?

Answer 2

1. Every leaf node is at the same depth.
2. Each non-leaf node has two children.
3. A full binary tree of depth n has: 2^n leaves, 2^(n+1) - 1 nodes

Question 3

What are the characteristics of a complete binary tree?

Answer 3

All levels are fully filled except possibly the last. Nodes at the deepest level are as far left as possible.

Question 4

How many leaves and total nodes can a complete binary tree of depth n have?

Answer 4

At most 2^n leaves, Up to 2^(n+1) - 1 nodes

Question 5

What’s the difference between a full binary tree and a complete binary tree?

Answer 5

A full binary tree has all leaves at the same depth and every non-leaf node has exactly two children. A complete binary tree may have a partially filled last level, but the nodes are as far left as possible.

Question 6

How many leaves and total nodes are in a full binary tree of depth n?

Answer 6

A full binary tree of depth n has exactly 2^n leaves and up to 2^(n+1) - 1 nodes.