Skip to content
Related Articles

Related Articles

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

View Discussion
Improve Article
Save Article
Like Article
  • Last Updated : 18 Apr, 2018

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

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!