Open In App

UGC-NET | UGC NET CS 2016 July – II | Question 23

Like Article
Like
Save
Share
Report

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be
(A) n / 2 – 1
(B) n / 2 + 1
(C) (n – 1) / 2
(D) (n + 1) / 2


Answer: (C)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post


Last Updated : 18 Apr, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads