1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Tanya [424]
3 years ago
7

The Integers 10, 30, 20 are inserted in that order, into an AVL Tree. Which sequence of commands will make the correct method ca

lls to rebalance the tree?

Computers and Technology
1 answer:
mel-nik [20]3 years ago
4 0

Answer and Explanation:

After inserting the integers "10", "30" and "20" in an AVL tree, It looks like:

This tree is not balanced. So, to balance this tree, we have to follow some steps:

Step 1 :

After following the LR (Left rotation), Tree will look like:

Step 2 :

Now, following the RL (Right rotation), we will get a balanced AVL tree like:

You might be interested in
Why was the IPv6 address format created? Select one:
Crazy boy [7]

Answer: D

Explanation:

8 0
3 years ago
Java: which expression is evaluated first
nignag [31]

Answer:c ll d  

Explanation:

cus they are inside ()--parantheses

5 0
3 years ago
Which number is the decimal equivalent of 1100110 – 101101?
erastovalidia [21]

1100110-101101 = 111001 = 57

3 0
3 years ago
Read 2 more answers
#Write a function called is_composite. is_composite should #take as input one integer. It should return True if the #integer is
malfutka [58]

Answer:

// A optimized school method based C++ program to check  

// if a number is composite.  

#include <bits/stdc++.h>  

using namespace std;  

bool isComposite(int n)  

{  

// Corner cases  

if (n <= 1) return false;  

if (n <= 3) return false;  

// This is checked so that we can skip  

// middle five numbers in below loop  

if (n%2 == 0 || n%3 == 0) return true;  

for (int i=5; i*i<=n; i=i+6)  

 if (n%i == 0 || n%(i+2) == 0)  

 return true;  

return false;  

}  

// Driver Program to test above function  

int main()  

{  

isComposite(11)? cout << " true\n": cout << " false\n";  

isComposite(15)? cout << " true\n": cout << " false\n";  

return 0;  

}

Explanation:

3 0
3 years ago
Your friend really likes talking about owls. Write a function owl_count that takes a block of text and counts how many words the
andriy [413]
Text = “ I really like owls. Did you know that an owls eyes are more than twice as big as the eyes of other birds of comparable weight? And that when an owl partially closes its eyes during the day, it is just blocking out light? Sometimes I wish I could be an owl.

word = ‘owl’
texts = text.lower()
owlist = list(texts.split())
count = text.count(word)
num = [owlist, count] #num has no meaning just random var
print(num)


Alter in anyway you want so that you can succeed. ✌
4 0
3 years ago
Other questions:
  • When desktop publishing software can interact with another software program, the two are said to
    6·1 answer
  • Your company sent several staff members for UML training. An outside vendor provided the training. Everyone who attended the tra
    5·1 answer
  • Read the scenario below and then answer the
    14·1 answer
  • Can someone help me with the 2.4 code practice question 2 on Edhesive???
    6·1 answer
  • Problem 3. Consider the following recurrence, defined for n a power of 4 (for the time of some algorithm): T(n) = 3 if n = 1 2T(
    5·1 answer
  • Write a function to output an array of ints on a single line. Funtion Should take an array and an array length and return a void
    9·1 answer
  • The larger the Word Size of a computer
    6·1 answer
  • Here's a better picture of my pc mouse and keyboard​
    5·2 answers
  • Did anyone else remember that Unus Annus is gone? I started crying when I remembered.... Momento Mori my friends.... Momento Mor
    9·2 answers
  • 1. You are given a database to create, however, you realize that in the instructions you are told to create relationships betwee
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!