Implement tree data structures and algorithms
Open
data-structure
difficulty:medium
enhancement
tree
- Dominant language
- Hy
- Stars
- 2
- Forks
- 0
- PR merge metrics
- No merged PRs in 30d
Description
Create implementations for common tree data structures and algorithms:
- Binary Tree
- Binary Search Tree (BST)
- AVL Tree
- Red-Black Tree
- B-Tree
- Tree traversals (pre-order, in-order, post-order, level-order)
- Trie implementation
- Segment Tree
- Fenwick Tree (Binary Indexed Tree)
Each implementation should include:
- Basic operations (insert, delete, search)
- Hy-specific optimizations
- Test cases
- Example usage
This will provide core tree data structures for the library.
Contributor guide
Assessment
This issue has not been assessed yet.