37 votes 37 votes Which of the following statements is false? A tree with a $n$ nodes has $(n – 1)$ edges A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results. A complete binary tree with $n$ internal nodes has $(n + 1)$ leaves. The maximum number of nodes in a binary tree of height h is $2^{h+1} - 1$ DS gate1998 data-structures tree multiple-selects normal + – Kathleen asked Sep 25, 2014 edited May 15, 2018 by Milicevic3306 Kathleen 16.7k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments shashankrustagi commented Jan 29, 2021 reply Follow Share Option C is false. Option B is true. 0 votes 0 votes Bikash Singh commented Jan 29, 2021 reply Follow Share Option B is true only if the given tree is a Binary Search tree 1 votes 1 votes Psy Duck commented Aug 11, 2022 reply Follow Share if its a complete binary tree not the almost CBT 0 votes 0 votes Please log in or register to add a comment.
–1 votes –1 votes Option C will be true in case of strictly binary tree in which each non leaf node has non empty left and right child. rishu_darkshadow answered Sep 18, 2017 rishu_darkshadow comment Share Follow See all 0 reply Please log in or register to add a comment.