May 1, 2024
4 minute read
AVL trees are a type of self-balancing binary search tree. They were invented by Adelson-Velsky and Landis in 1962. AVL trees are used to store data in a way that allows for efficient searching, insertion, and deletion. AVL tress are used in a variety of applications, including databases, file systems, and network routing.
Searching in AVL Trees
owirif|
Find a path to becoming a AVL Trees. Learn more at:
OpenCourser.com/topic/owirif/avl
Reading list
We've selected 12 books
that we think will supplement your
learning. Use these to
develop background knowledge, enrich your coursework, and gain a
deeper understanding of the topics covered in
AVL Trees.
This classic textbook provides a comprehensive overview of algorithms, including AVL trees. It highly respected and widely used book, and it valuable resource for anyone who wants to learn more about algorithms.
Provides a comprehensive overview of algorithms. It includes a chapter on AVL trees, and it valuable resource for anyone who wants to learn more about algorithms.
Provides a comprehensive overview of algorithms. It includes a chapter on AVL trees, and it valuable resource for anyone who wants to learn more about algorithms.
Provides a comprehensive overview of algorithms. It includes a chapter on AVL trees, and it valuable resource for anyone who wants to learn more about algorithms.
Provides a practical guide to algorithm design and analysis. It includes a chapter on AVL trees, and it valuable resource for anyone who wants to learn more about how to design and analyze algorithms.
Provides a comprehensive overview of data structures and algorithms in Java. It includes a chapter on AVL trees, and it valuable resource for anyone who wants to learn more about how to implement data structures and algorithms in Java.
Provides a comprehensive overview of algorithms and data structures for massive datasets. It includes a chapter on AVL trees, and it valuable resource for anyone who wants to learn more about how to implement algorithms and data structures for massive datasets.
Provides a comprehensive overview of data structures and algorithms in Java. It includes a chapter on AVL trees, and it valuable resource for anyone who wants to learn more about how to implement data structures and algorithms in Java.
Provides a comprehensive overview of data structures and algorithms in Python. It includes a chapter on AVL trees, and it valuable resource for anyone who wants to learn more about how to implement data structures and algorithms in Python.
Provides a comprehensive overview of data structures and algorithms in C++. It includes a chapter on AVL trees, and it valuable resource for anyone who wants to learn more about how to implement data structures and algorithms in C++.
Provides a comprehensive overview of algorithms in C. It includes a chapter on AVL trees, and it valuable resource for anyone who wants to learn more about how to implement algorithms in C.
Provides a comprehensive overview of data structures and algorithms, including AVL trees. It is written in a clear and concise style, and it includes numerous examples and exercises to help readers understand the material.
For more information about how these books relate to this course, visit:
OpenCourser.com/topic/owirif/avl
Save
