0 0 votes Consider a binary tree, where for every node $P-Q\leq 2$.Prepresent number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for $h>0$. The minimum number of node present in such binary tree of height $h=4$ _____________ Im getting 8. kindly verify Programming in C data-structures binary-tree + – Pawan Kumar 2 1.8k views answer comment Share Follow Print See all 8 Comments 8 8 Comments reply Jaideep Bankoti commented Dec 4, 2018 reply Follow flag shouldn't nine be the answer , right now the value at root is 3, add one more to the right sub-tree 0 0 replyShare aambazinga commented Dec 4, 2018 reply Follow flag right subtree of root node contains 1 more node. answer is 9 0 0 replyShare kumar.dilip commented Dec 4, 2018 reply Follow flag aambazinga Jaideep Bankoti Why right side should contain one more node ??? 0 0 replyShare Pawan Kumar 2 commented Dec 4, 2018 reply Follow flag oh I missed one thanks .. kumar.dilip there are five nodes in left subtree and two in right so one has to be added to make it <=2. 0 0 replyShare Shaijal Tripathi commented Dec 4, 2018 reply Follow flag Here, it only speaks about a binary tree, and P-Q<=2, so can we take P-Q as negative and obtain minimum number of nodes as 5? 0 0 replyShare Jaideep Bankoti commented Dec 4, 2018 reply Follow flag agreed , the tree can grow skewed towards right 0 0 replyShare Shaijal Tripathi commented Dec 4, 2018 reply Follow flag Exactly, so answer is 5? 0 0 replyShare Naveen Kumar 3 commented Dec 4, 2018 reply Follow flag https://gateoverflow.in/239308/made-easy 0 0 replyShare Please log in or register to add a comment.
