Register

GATE CSE 1996 | Question: 2.14

• edited by
30,602 views
27 votes
27 votes

A binary search tree is generated by inserting in order the following integers:

$$50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24$$

The number of nodes in the left subtree and right subtree of the root respectively is

  1. $(4, 7)$
  2. $(7, 4)$
  3. $(8, 3)$
  4. $(3, 8)$
• edited by
User Avatar

5 Answers

Page:
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

54 votes
54 votes
7 answers
1
Kathleen asked Oct 9, 2014
22,882 views
GATE CSE 1996 | Question: 4
A binary search tree is used to locate the number $43$ ...
A binary search tree is used to locate the number $43$. Which of the following probe sequences are possible and which are not? Explain.$\begin{array}{llllll} \text{(a)} ...
User Avatar
28 votes
28 votes
3 answers
2
Kathleen asked Oct 9, 2014
13,588 views
GATE CSE 1996 | Question: 2.11
The minimum number of interchanges needed to convert the array into a max-heap is $89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70$ $0$ $1$ $2$ $3$
The minimum number of interchanges needed to convert the array into a max-heap is$89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70$$0$$1$$2$$3$
User Avatar
21 votes
21 votes
3 answers
3
Kathleen asked Oct 9, 2014
4,397 views
GATE CSE 1996 | Question: 1.15
Which of the following sequences denotes the post order traversal sequence of the below tree? $f\; e\; g\; c\; d\; b\; a$ $g\; c\; b\; d\; a\; f\; e$ $g\; c\; d\; b\; f\; e\; a$ $f\; e\; d\; g\; c\; b \;a$
Which of the following sequences denotes the post order traversal sequence of the below tree?$f\; e\; g\; c\; d\; b\; a$$g\; c\; b\; d\; a\; f\; e$$g\; c\; d\; b\; f\; e\...
User Avatar
Link Copied!