AVL TREE Prof. Manjusha Amritkar Information

min-jolicoeur
Published  · 21 slides · 0 views
↓ Download
AVL TREE Prof. Manjusha Amritkar Information
1 / 1
AVL TREE Prof. Manjusha Amritkar Information - slide 1 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 2 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 3 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 4 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 5 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 6 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 7 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 8 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 9 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 10 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 11 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 12 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 13 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 14 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 15 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 16 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 17 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 18 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 19 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 20 of 21 AVL TREE Prof. Manjusha Amritkar Information - slide 21 of 21
Description
AVL TREE Prof. Manjusha Amritkar Information Technology Department International Institute of Information Technology, I²IT www.isquareit.edu.in Binary Search Tree E.g. 2,4,6,8,10 Right skewed tree Time needed to perform insertion ,deletion

Related Topics

Download this presentation From Below

"AVL TREE Prof. Manjusha Amritkar Information" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Presentation Transcript

01
AVL TREE Prof. Manjusha Amritkar
Information Technology Department

International Institute of Information Technology, I²IT
www.isquareit.edu.in<br>
02
Binary Search Tree E.g. 2,4,6,8,10



Right skewed tree

Time needed to perform insertion ,deletion and many other operations is O(N) in worst case.
We need tree with small height with Log N
Such trees are called as Balanced Binary Search Tree
e.g AVL tree, Red Black Tree International Institute of Information Technology, I²IT, P-14, Rajiv Gandhi Infotech Park, Hinjawadi Phase 1, Pune - 411 057
Phone - +91 20 22933441/2/3 | Website - www.isquareit.edu.in | Email - info@isquareit.edu.in<br>
03
AVL Tree AVL tree Named after their inventor Adelson, Velski & Landis, is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes.

The difference between the heights is called
as balanced factor (BF)

BF = height (left subtree) – height (right subtree)

The tree is balanced when BF is -1, 0, 1 International Institute of Information Technology, I²IT, P-14, Rajiv Gandhi Infotech Park, Hinjawadi Phase 1, Pune - 411 057
Phone - +91 20 22933441/2/3 | Website - www.isquareit.edu.in | Email - info@isquareit.edu.in<br>