---
title: "Discussion on \"AVL tree\" | Hashnode"
description: "Discussion on \"AVL tree\". An unbalanced binary search tree has the worst case search time of O(n). Therefore, balancing the tree will make search time more efficient.\nAVL Tree, named after its inventors Adelson-Velsky and Landis, is a special variation of Binary Search Tree w..."
url: "https://hashnode.com/posts/avl-tree/630618d7d69cbd567158770c"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [AVL tree](https://ashoksubbiah.in/avl-tree?utm_source=hashnode&utm_medium=feed)

An unbalanced binary search tree has the worst case search time of O(n). Therefore, balancing the tree will make search time more efficient. AVL Tree, named after its inventors Adelson-Velsky and Landis, is a special variation of Binary Search Tree w...

Jan 16, 2020 · 2 min read · ashoksubbiah.in  
Read the article

-   [#data-structures](https://hashnode.com/tag/data-structures)

## Written by

[Ashok](https://hashnode.com/@AshokSubbiah)

@AshokSubbiah

  
[View profile](https://hashnode.com/@AshokSubbiah)

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
