Create an AVL Tree for the given values 21, 26, 30, 9, 4, 14, 28, 18,15,10, 2, 3, 7. What is the root node element
Question
Create an AVL Tree for the given values 21, 26, 30, 9, 4, 14, 28, 18,15,10, 2, 3, 7. What is the root node element
Solution
To create an AVL Tree for the given values 21, 26, 30, 9, 4, 14, 28, 18, 15, 10, 2, 3, and 7, we will follow these steps:
- Start by inserting the first value, 21, as the root node of the AVL Tree.
- Insert the next value, 26, as the right child of the root node since it is greater than 21.
- Insert the next value, 30, as the right child of the node with the value 26 since it is greater than 26.
- Insert the next value, 9, as the left child of the root node since it is smaller than 21.
- Insert the next value, 4, as the left child of the node with the value 9 since it is smaller than 9.
- Insert the next value, 14, as the right child of the node with the value 9 since it is greater than 9.
- Insert the next value, 28, as the left child of the node with the value 30 since it is smaller than 30.
- Insert the next value, 18, as the left child of the node with the value 14 since it is smaller than 14.
- Insert the next value, 15, as the right child of the node with the value 18 since it is greater than 18.
- Insert the next value, 10, as the left child of the node with the value 14 since it is smaller than 14.
- Insert the next value, 2, as the left child of the node with the value 4 since it is smaller than 4.
- Insert the next value, 3, as the right child of the node with the value 2 since it is greater than 2.
- Insert the last value, 7, as the right child of the node with the value 4 since it is greater than 4.
After following these steps, the AVL Tree will look like this:
21
/ \
9 26
/ \ \
4 14 30
/ \ / /
2 7 10 28
\
18
/
15
Therefore, the root node element of the AVL Tree is 21.
Similar Questions
create a AVL tree whose element is 55,25, 65, 9,8,15
Step by step, construct an AVL tree for the following sequence: 144, 151, 162, 70, 41, 120, 158. Draw thetree at each step and give the step-by-step workout.
Define AVL tree, Co nstruct AVL-Treebyinserting a number from 1 to 8
Problem StatementImplement an AVL tree data structure that accepts a series of integers as input and constructs the AVL tree. After inserting all the integers, perform an in-order traversal of the AVL tree and print the elements.Input format :The first line of input consists of the number of nodes in the AVL Tree, N.The second line of input consists of the nodes of the AVL Tree, separated by space.Output format :The output prints the in-order traversal of the constructed AVL Tree, separated by space.
Which of the following is an AVL Tree?
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.