GATE CSE 2004 | Trees Question 56 | Data Structures

GATE CSE 2004

MCQ (Single Correct Answer)

-0.3

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

GATE CSE 2003

MCQ (Single Correct Answer)

-0.3

Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree?

7 5 1 0 3 2 4 6 8 9

0 2 4 3 1 6 5 9 8 7

0 1 2 3 4 5 6 7 8 9

9 8 6 4 2 3 0 1 5 7

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

Consider the following nested representation of binary trees: (X Y Z) indicates Y and Z are the left and right sub stress, respectively, of node X. Note that Y and Z may be NULL, or further nested. Which of the following represents a valid binary tree?

(1 2 (4 5 6 7))

(1 (2 3 4) 5 6) 7)

(1 (2 3 4)(5 6 7))

(1 (2 3 NULL) (4 5))

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

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 ).