https://github.com/tim-hub/avl_bst_tree
an AVL tree
https://github.com/tim-hub/avl_bst_tree
data-structures
Last synced: about 1 year ago
JSON representation
an AVL tree
- Host: GitHub
- URL: https://github.com/tim-hub/avl_bst_tree
- Owner: tim-hub
- License: apache-2.0
- Created: 2018-06-07T02:35:55.000Z (almost 8 years ago)
- Default Branch: master
- Last Pushed: 2018-06-07T05:56:36.000Z (almost 8 years ago)
- Last Synced: 2025-01-23T18:50:34.108Z (about 1 year ago)
- Topics: data-structures
- Language: C
- Size: 12.7 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
## AVL Tree Assignment 2
Create efficient binary search trees. An AVL tree is a BST that is guaranteed to always be balanced.
Platform:
- GCC Version: (Apple LLVM version 9.0.0 (clang-900.0.39.2) Target: x86_64-apple-darwin16.7.0)
- Online Complier (https://www.onlinegdb.com/online_c_compiler)
Author: Tim
## Features
- a binary search tree (base on work in lab 4)
- check balance
- rotate left and double rotate right
- rotate right and double rotate left
## How to use
```
gcc ./AVL.c
./a.out
```
There are some sample code in `main function`, comment them or uncomment them can be easily test these codes.