• Email
  • Like
  • Save
  • Private Content
  • Embed
 

Computer notes - AVL Tree

by

  • 524 views

AVL (Adelson-Velskii and Landis) tree. An AVL tree is identical to a BST except height of the left and right subtrees can differ by at most 1.height of an empty tree is defined to be (–1).

AVL (Adelson-Velskii and Landis) tree. An AVL tree is identical to a BST except height of the left and right subtrees can differ by at most 1.height of an empty tree is defined to be (–1).

Accessibility

Categories

Upload Details

Uploaded via SlideShare as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate. If needed, use the feedback form to let us know more details.

Cancel

Statistics

Likes
0
Downloads
36
Comments
0
Embed Views
0
Views on SlideShare
524
Total Views
524
Post Comment
Edit your comment

Computer notes - AVL Tree Computer notes - AVL Tree Presentation Transcript