Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Programming and Data Structure Binary Heap Binary Search Tree
Which of the following statement is/are false?
I. A binary tree with n internal nodes has n + 1 leaf nodes.
II. If the height of the root node is 1, then the maximum number of nodes in a binary tree of height h is 2h+1 – 1
III. A labeled root binary search tree can be uniquely constructed given its preorder traversal results1
Only I
2
Only I and II
3
Only II and III
4
I, II and III