1 votes 1 votes DS binary-tree data-structures normal + – Rohan Mundhey asked Nov 5, 2016 recategorized Jul 6, 2022 by Lakshman Bhaiya Rohan Mundhey 1.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes A) False. A tree with n nodes has n-1 edges. B)False With Postorder and preorder it's not possible to construct a binary tree. C)False Maximum number of nodes are 2^h -1 D)True Full binary tree with n internal nodes have n+1 leaves. Prabhanjan_1 answered Nov 5, 2016 selected Nov 5, 2016 by Rohan Mundhey Prabhanjan_1 comment Share Follow See all 0 reply Please log in or register to add a comment.