Discrete Structure: Multiple Choice What is the height of the tree shown below?

28 0

Get full Expert solution in seconds

$1.97 ONLY

Unlock Answer


Answer: 4
Explanation: Height of a single node is zero. Consider the last level (h). Height of h = 0. Go to the ancestors, till root is visited and increase the height by 1 each time.


Explanation: An acyclic graph (tree) of 7 vertices can have at most 6 edges only. So, it is impossible to have above criteria.