9.10 Let t be a non-empty tree. Show that if leaves(t ) = n(t ) + 1 / 2.0 then either both subtrees of t are empty or both subtrees of t are non-empty. Note: Do not use Part 3 of the Binary Tree Theorem. This exercise can be used in the proof of Part 3. | |
| View Solution | |
| << Back | Next >> |