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

Last Updated :
Discuss
Comments
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
n / 2 - 1
n / 2 + 1
(n – 1) / 2
(n + 1) / 2

This question is part of this quiz :

Top MCQs on Binary Trees Data Structure with Answers,UGC NET CS 2016 July – II
Tags:
DSA Quiz
UGC-NET
Share your thoughts in the comments