Discrete Structures - Old Questions
15. Define rooted tree. Show that a full m-ary tree with i internal vertices contains n = mi + 1 vertices.
4 marks
|
Asked in 2074