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

Optimality - heuristic search strategies, Optimality - Heuristic search str...

Optimality - Heuristic search strategies: The path cost of a solution is considered as the sum of the costs of the actions that led to which solution is given. This is only on

Nmknl''knl, Ask question bhjjnjnnjnjm#Minimum 100 words accepted#

Ask question bhjjnjnnjnjm#Minimum 100 words accepted#

Can we use flow logic control key words in abap/4, Can we use flow logic co...

Can we use flow logic control key words in ABAP/4 and vice-versa The flow control  of a dynpro having os a few statements that syntactically ressemble ABAP/4  statements .Thou

Explain e-mail gateways, Explain E-mail gateways. Email using SMTP work...

Explain E-mail gateways. Email using SMTP works better while both the sender and the receiver are on the Internet and can support TCP connections among sender and receiver. Tho

Returns the information about tasks running, Returns the information about ...

Returns the information about tasks running int info = pvm_tasks( int where, int *ntask, struct pvmtaskinfo **taskp ) struct pvmtaskinfo {  int ti_tid; int ti_pt

What is access latency and rotation speed, Q. What is Access latency and Ro...

Q. What is Access latency and Rotation Speed? Access latency: A disk access basically moves the arm to selected cylinder and waits for rotational latency that may take less t

C Programming, Program about railway reservation system using structure . G...

Program about railway reservation system using structure . Get 10 names,their gender ,address , seats availability according to trains and some extra datas

Explain about encoding technique used in bitmaps indexes, Bitmaps commonly ...

Bitmaps commonly use one bitmap for each single distinct value. Number of bitmaps used can be decreased by opting for a dissimilar type of encoding. Space can be optimized but when

Explain working of telnet, Q. Explain Working of TELNET? The working o...

Q. Explain Working of TELNET? The working of TELNET 1.  Commands and characters are sent to operating system on common server computer. 2.  Local operating system send

Illustration of parallel programming environments, Q. Illustration of paral...

Q. Illustration of parallel programming environments? Let's discuss illustrations of parallel programming environments of Intel paragaon XP/S and Cray Y-MP software. The Cra

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