https://github.com/basemax/completetreecheckergo
This is a simple Go program that checks if a given tree is complete or not. A tree is complete if all levels are completely filled except possibly the last level and the last level has all keys as left as possible.
https://github.com/basemax/completetreecheckergo
complete-tree data-structure datastructure ds go golang tree tree-complete tree-search tree-structure tree-traversal tree-traversal-algorithm tree-traversal-algorithms
Last synced: 6 months ago
JSON representation
This is a simple Go program that checks if a given tree is complete or not. A tree is complete if all levels are completely filled except possibly the last level and the last level has all keys as left as possible.
- Host: GitHub
- URL: https://github.com/basemax/completetreecheckergo
- Owner: BaseMax
- License: gpl-3.0
- Created: 2022-12-24T12:19:05.000Z (almost 3 years ago)
- Default Branch: main
- Last Pushed: 2022-12-24T12:36:43.000Z (almost 3 years ago)
- Last Synced: 2025-03-28T17:08:04.783Z (6 months ago)
- Topics: complete-tree, data-structure, datastructure, ds, go, golang, tree, tree-complete, tree-search, tree-structure, tree-traversal, tree-traversal-algorithm, tree-traversal-algorithms
- Language: Go
- Homepage:
- Size: 18.6 KB
- Stars: 2
- Watchers: 2
- Forks: 0
- Open Issues: 0