https://github.com/lesiaukr/goit-algo-hw-07
Master's | Basic Algorithms & Data structures | Module 7 | Trees and Balancing
https://github.com/lesiaukr/goit-algo-hw-07
avl-tree binary-search-tree goit-algo-hw-07
Last synced: 7 months ago
JSON representation
Master's | Basic Algorithms & Data structures | Module 7 | Trees and Balancing
- Host: GitHub
- URL: https://github.com/lesiaukr/goit-algo-hw-07
- Owner: LesiaUKR
- Created: 2024-07-18T06:17:14.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2024-07-18T15:35:38.000Z (about 1 year ago)
- Last Synced: 2025-01-29T23:16:18.994Z (9 months ago)
- Topics: avl-tree, binary-search-tree, goit-algo-hw-07
- Language: Python
- Homepage:
- Size: 3.91 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# goit-algo-hw-07
# Homework | Module 7 | Trees and Balancing
## Task 1
Write an algorithm (function) that finds the maximum value in a binary search tree or AVL tree. Use any implementation of the tree from your lecture notes or another source.
## Task 2
Write an algorithm (function) that finds the minimum value in a binary search tree or AVL tree. Use any implementation of the tree from your lecture notes or another source.
## Task 3
Write an algorithm (function) that finds the sum of all values in a binary search tree or AVL tree. Use any implementation of the tree from your lecture notes or another source.