Question

Download Solution PDF

How many rotations are required during the construction of an AVL tree if the following elements are to be added in the given sequence?

35, 50, 40, 25, 30, 60, 78, 20, 28

  1. 2 left rotations, 2 right rotations
  2. 2 left rotations, 3 right rotations
  3. 3 left rotations, 2 right rotations
  4. 3 left rotations, 1 right rotation

Answer (Detailed Solution Below)

Option 3 : 3 left rotations, 2 right rotations

Detailed Solution

Download Solution PDF

The correct answer is Option 3

Explanation:

 Right Rotate = 1 ⇒   Left Rotate = 1 ⇒

   Right Rotate = 1 ⇒   

Right Rotate = 1 ⇒ Left Rotate = 1 ⇒ 

Download Solution PDF
‹‹ Previous Ques
Next Ques ››
Exams Tests Super Practice

More Binary Heap Questions

Q1.Let T(n) be the number of different binary search trees on n distinct elements-then \(\mathrm{T}(\mathrm{n})=\sum_{\mathrm{k}=1}^{\mathrm{n}} T(K-1) T(x)\) where x is :
Q2.The number of nodes of height h in any n-element heap is atmost:
Q3.How many rotations are required during the construction of an AVL tree if the following elements are to be added in the given sequence? 35, 50, 40, 25, 30, 60, 78, 20, 28
Q4.What will be post order traversal of a binary Tree T, if preorder and inorder traversals of T are given by ABCDEF and BADCFE respectively?
Q5.Consider the given binary search tree, if the root node will be deleted, the new root can be -
Q6.Which of the following is a height of a given binary tree? Hint: The height of a binary tree is equal to the largest number of edges from the root to the most distant leaf node.
Q7.Given a fixed‐length record file that is ordered on the key field. The file needs B disk blocks to store R number of records. Find the average access time needed to access any record of the given file using binary search.
Q8.Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 3rd largest element of the tree is stored at index
Q9.In searching an element in a binary tree, number of comparisons is _________.
Q10.Consider that N distinct elements (N > 3) are inserted into an initially empty binary search tree (BST). Which of the following statements are true?

More Programming and Data Structure Questions

Q1.What is the output of the following code? int i = 1 ; while ( i <= 10 ) printf ( "%d\n", i );
Q2.Which of the following is the syntax of the conditional operator in C?
Q3.Which of the following is a unary operator in C?
Q4.If a C program contains only one function, it must be __________.
Q5.Which operator is used for bitwise OR in C?
Q6.What is the purpose of the sizeof operator in C?
Q7.Which of the following functions is used to find the length of a string in C?
Q8.The ternary operator can be used as a replacement for which loop/statement?
Q9.What is the limitation of the conditional operator (? :) in C?
Q10.What is a recursive function?
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
support@testbook.com
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Hot Links： teen patti gold download apk teen patti classic teen patti master 2024 teen patti download apk teen patti earning app