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

C++, What are virtual Functions

What are virtual Functions

State the important features of operating system, a. Define operating syste...

a. Define operating system? State the important features of operating system? b. Describe the following facilities for implementing interacting processes in programming language

What do you mean by mouse protocols, Q. What do you mean by Mouse Protocols...

Q. What do you mean by Mouse Protocols? Mouse protocol is the digital code to that signal from the mouse gets converted. There are four main protocols: Microsoft, Mouse Systems

Binary search tree, Given the following interface public interface WordS...

Given the following interface public interface WordSet extends Iterable { public void add(Word word); // Add word if not already added public boolean contains(Word word);

Discuss the 5-level switching hierarchy recommended by ccitt, Discuss the 5...

Discuss the 5-level switching hierarchy recommended by CCITT. Hierarchical networks are able of handling heavy traffic where needed, and at similar time use minimal number of t

What is a fifo, What is a FIFO? FIFO is otherwise known as 'named pipes...

What is a FIFO? FIFO is otherwise known as 'named pipes'. FIFO (first-in-first-out) is a particular file which is said to be data transient. Once data is read from named pipe,

Explain the basic syntactic constructs through reductions, Recognition of b...

Recognition of basic syntactic constructs through reductions, this task is performed by? By Syntax analysis, recognition of fundamental syntactic constructs through reductions

Assessing heuristic searches , Assessing Heuristic Searches: Given a p...

Assessing Heuristic Searches: Given a particular problem you want to build an agent to solve, so there may be more than one way of justifying it as a search problem, more than

Show error detection mechanism, Q. Show Error detection mechanism? Erro...

Q. Show Error detection mechanism? Error detection mechanism can be described as below: Figure: Error detection and correction

Elements of composition, The Elements of composition are the formal languag...

The Elements of composition are the formal language used to communicate in the visual arts. The elements of composition can be loosely broken into 5 main elements, Line, shape, val

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