Register

ISRO-2013-2

• edited by
8,448 views

2 Answers

Best answer
20 votes
20 votes

Answer is D] 3

Rotations are : LL LL RR 

• selected by
User Avatar
3 votes
3 votes
Number of rotation = 3

Following are the roatation

1. LL

2 LL

3.RR
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

40 votes
40 votes
5 answers
1
Kathleen asked Sep 22, 2014
43,555 views
GATE CSE 2009 | Question: 37,ISRO-DEC2017-55
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$. $2$ $3$ $4$ $5$
What is the maximum height of any AVL-tree with $7$ nodes? Assume that the height of a tree with a single node is $0$.$2$$3$$4$$5$
User Avatar
3 votes
3 votes
2 answers
2
makhdoom ghaya asked Apr 27, 2016
6,244 views
ISRO-2013-32
Which of the following number of nodes can form a full binary tree? 8 15 14 13
Which of the following number of nodes can form a full binary tree?8151413
User Avatar
9 votes
9 votes
3 answers
3
makhdoom ghaya asked Apr 25, 2016
9,194 views
ISRO-2013-9
In an array of $2N$ elements that is both 2-ordered and 3-ordered, what is the maximum number of positions that an element can be from its position if the array were 1-ordered? $1$ $2$ $N/2$ $2N - 1$
In an array of $2N$ elements that is both 2-ordered and 3-ordered, what is the maximum number of positions that an element can be from its position if the array were 1-or...
User Avatar
5 votes
5 votes
2 answers
4
makhdoom ghaya asked Apr 25, 2016
6,691 views
ISRO-2013-4
The following steps in a linked list p = getnode() info(p) = 10 next (p) = list list = p result in which type of operation? Pop operation in stack Removal of a node Inserting a node Modifying an existing node
The following steps in a linked listp = getnode() info(p) = 10 next (p) = list list = presult in which type of operation?Pop operation in stackRemoval of a nodeInserting ...
User Avatar
Link Copied!