---
title: "Discussion on \"An implementation to AVL Tree (using golang)\" | Hashnode"
description: "Discussion on \"An implementation to AVL Tree (using golang)\". introduction\n AVL Tree named after its inventor Adelson-Velskii and Landis is a sort of binary search tree. There is a balance factor -1,0,1 which represents the balance state on each node. For more simple implementation, we record the height of the ..."
url: "https://hashnode.com/posts/an-implementation-to-avl-tree-using-golang/6345669b13b6a47ffec218a3"
---

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

Discussion

# [An implementation to AVL Tree (using golang)](https://xue1.top/an-implementation-to-avl-tree-using-golang?utm_source=hashnode&utm_medium=feed)

introduction AVL Tree named after its inventor Adelson-Velskii and Landis is a sort of binary search tree. There is a balance factor -1,0,1 which represents the balance state on each node. For more simple implementation, we record the height of the ...

Oct 11, 2022 · 8 min read · xue1.top  
Read the article

-   [#go](https://hashnode.com/tag/go)
-   [#algorithms](https://hashnode.com/tag/algorithms)

## Written by

[Yuanfei Yang](https://hashnode.com/@yuanfei)

@yuanfei · Beijing, China

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

never give up!

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
