0 votes 0 votes In a binary tree, for every node the difference between the number of nodes in the left and right sub trees is atmost 2. If the height of the tree is h > 0 , then the minimum number of nodes in the tree is A) 2 h-1 B) 2h-1 +1 C) 2h - 1 D) 2h DS binary-tree + – Sankaranarayanan P.N asked Oct 27, 2016 Sankaranarayanan P.N 430 views answer comment Share Follow See 1 comment See all 1 1 comment reply Kapil commented Oct 27, 2016 reply Follow Share https://gateoverflow.in/3811/gate2005-it_50 0 votes 0 votes Please log in or register to add a comment.