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

Differentiate among validation and exception testing, Differentiate between...

Differentiate between validation and exception testing. - Validation testing is done to test software in conformance to requirements specified. It aims to demonstrate that soft

Explain rudimentary file formats, Q. Explain rudimentary file formats? ...

Q. Explain rudimentary file formats? FTP only understands two rudimentary file formats. It classifies every file either as a text file or a binary file. A text file comprise a

What is verilog function, What is Verilog function - A function is una...

What is Verilog function - A function is unable to enable a task however functions can enable other functions. - A function would carry out its required duty in zero simula

Postpurchase interaction, Postpurchase Interaction Customer service an...

Postpurchase Interaction Customer service and support: The considerations at this stage can be explained by the following example: Consider a bundle having of a portfolio

Show basic types of transmission technologies, Q. What are the basic types ...

Q. What are the basic types of Transmission technologies, basis on which computer networks will be categorized? Ans: Broadly there are two kinds of transmission technology:

What is boyce codd normal form, A relation schema R is in BCNF with respect...

A relation schema R is in BCNF with respect to a set F of functional dependencies if for all functional dependencies in F+ of the form a->b, where a and b is a subset of R, at leas

Define virtual memory, Normal 0 false false false EN-IN...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Computer organization, using one-address instructions,write a program to co...

using one-address instructions,write a program to compute X=A-BxC

What are the data types of the external layer, What are the Data types of t...

What are the Data types of the external layer? The Data types of the external layer are :- ACCP, Char, CLNT, CUKY, CURR, DATS, DESC, FLTP, INT1, INT2, INT4, LANG, LCHR, L

Drawback of indirect addressing, Q. Drawback of indirect addressing? • ...

Q. Drawback of indirect addressing? • Drawback of this scheme is that it needs two memory references to fetch actual operand. First memory reference is to fetch the actual addr

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