Skip to content
/ avl-tree Public

AVL Tree is a self-balancing binary search tree where the height difference of the left and right subtrees can't exceed 1. It's named after Adelson-Velsky and Landis and provides efficient search, insert, and delete operations with O(log n) time complexity, making it a reliable choice for large data sets.

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

darian-catalin-cucer/avl-tree

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
README.md
README.md
 
 
kotlin.kt
kotlin.kt
 
 

Repository files navigation

AVL Tree in Kotlin

A Kotlin implementation of AVL Tree, a self-balancing binary search tree. This implementation allows you to insert elements into the tree and it will keep the height of the tree balanced.

Usage

To use the AVL Tree, simply create an instance of the `AVLTree

About

AVL Tree is a self-balancing binary search tree where the height difference of the left and right subtrees can't exceed 1. It's named after Adelson-Velsky and Landis and provides efficient search, insert, and delete operations with O(log n) time complexity, making it a reliable choice for large data sets.

Topics

android kotlin python java go ui-design development firebase mobile ui material-design cpp gradle libraries ux push-notifications user-experience kmp kmm

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages