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

Boundary tag management system, what are the two memory management scehme...

what are the two memory management scehme(boundary tag system,buddy system)

When should we stop testing, When should you stop testing? It is quite ...

When should you stop testing? It is quite complex to determine as many modern software applications are so complex and run in like an interdependent environment that complete t

Define constraints, Define Constraints Constraints can be defined as P...

Define Constraints Constraints can be defined as Preconditions (input values) and Post Conditions (output values). Preconditions on functions are constraints which input value

Or-introduction rule, Or-Introduction : Thus if we know about one thin...

Or-Introduction : Thus if we know about one thing is true, and also we know that a sentence when there thing is in a disjunction is true. Here if we consider example, like we

Principles of contract law, Andrew, a 17 zear old university student decide...

Andrew, a 17 zear old university student decided to hold a post exams party for his friends. Andrew asked Kath, a family friend and the owner of 'Kath's Katerers' to supply food

Non-repudiation achieved in designing e-cash based system, How can non-repu...

How can non-repudiation be achieved into designing e-cash based system? E-cash is fundamentally an online solution. The buyer should validate the coins by the issuer so as to g

Object oriented and structured oriented programming, What is the difference...

What is the difference among object oriented and structured oriented programming? Ans) ? Object Oriented means programme will be there in terms of Class and Object connection w

What are the 2 other types of views, What are the 2 other types of Views, w...

What are the 2 other types of Views, which are not allowed in Release 3.0? The two views are:- Structure Views. Entity Views.

What is java applet, A Applet is a java program that runs within a web brow...

A Applet is a java program that runs within a web browser.

Associative mapping - computer architecture, Associative Mapping: It i...

Associative Mapping: It is a more flexible mapping technique A primary memory block can be placed into any specific cache block position. Space in the cache may be

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