Consider a binary tree where for every node ⏐P – Q⏐ ≤ 2. P represents 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 nodes present in such binary tree of height h = 4 _________. (Assume root is at height 0)
I CAN GET IT BY 8 BUT ANSWER GIVEN IS 9 MORE LIKE THIS IS ANSWER BUT WHY THEY NEED THAT NODE AT RIGHT SUBTREE DIDNT GET THAT ( 3RD NODE AT 2ND LEVEL WHY IS THAT THERE I THINK WITHOUT IT WE ARE SATISYING CONDITIONS