In: Computer Science
(A) Discuss why in any tree we have |V|=|E|+1? (B) Provide a definition for complete binary trees. (C) What is the maximum number of vertices in depth d a complete ternary tree? Explain your response (Hint 1: a ternary tree is a tree in which each node can have at most 3 children. Hint 2: Depth of a tree starts from 0. That means root is in depth 0).