Explain how a node can be inserted into an avl tree, Computer Engineering

Assignment Help:

Explain how a node can be inserted into an AVL tree.

We can insert a node into an AVL tree through the insertion algorithm for binary search trees in which we compare the key of the latest node with that in the root and then insert the latest node into the left subtree or right subtree depending on whether it is less than or greater than that in the root. Insertion might or might not result in change in the height of the tree. Whereas inserting we must take care that the balance factor of any node not changes to values other than 0, 1 and -1. A tree becomes unbalanced if and only if

(i) The latest inserted node is a left descendant of a node that lastly had a balance of 1.

(ii) The latest inserted node is a right descendent of a node that lastly had a balance of -1.

 


Related Discussions:- Explain how a node can be inserted into an avl tree

Difference between digital zoom and optical zoom, Question: (a) What ar...

Question: (a) What are effect presets and how can they be helpful? (b) Explain the difference between digital zoom and optical zoom. (c) Explain exposure in the context o

Define the register addressing mode, Q. Define the Register Addressing mode...

Q. Define the Register Addressing mode? When operands are taken from registers implicitly or explicitly it is known as register addressing. These operands are termed as regis

Example of finding cross points and switches, For a non blocking crossbar c...

For a non blocking crossbar configuration, taking N as the number of subscribers, there will be               number of cross points and _             number of switches for est

Define multiprogramming, Define Multiprogramming. Multiprogramming: ...

Define Multiprogramming. Multiprogramming: A multiprogramming operating system is system which allows extra than one active user program or part of user program to be store

Bi polar junction transistor, draw input and output charectoristics of BJT ...

draw input and output charectoristics of BJT and justify CE configuration provides large current amplification

Difference between the fork -join and begin-end, Difference between the for...

Difference between the fork -join and begin-end. The fork - join keywords: Groups several statements together.Cause statements to be evaluated in parallel (all at the same

Granularity-concept of parallel execution and concurrent , Granularity ...

Granularity Granularity refers to the quantity of computation done in parallel relative to the dimension of the entire program. In parallel computing, granularity is a qualitat

What do conditional assignments get inferred into, What do conditional assi...

What do conditional assignments get inferred into? Conditionals  in  a  continuous  assignment  are  specified  through  the  "?:"  operator.  Conditionals  get inferred into a

Adder substractor, how can we bimpliment half substractor using nand gate

how can we bimpliment half substractor using nand gate

C++, luminous jewels polishing game

luminous jewels polishing game

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd