An implementation of binary tree algorithms. And it's all written in ANSI C - or pretended to be.
That it's actual status of my implementation:
It's very simple, on main directory only do this:
make && make run
- Me (Manoel Vilela)
GPLv3
- Create a binary tree structure
- Implement for any type:
char, int, float
- Methods
- Start
- Insert
- Remove
- Edit
- Search
- Sort
- Notation
- Prefix
- Posfix
- Infix
- Balance
- Attributes calculation
- Sum of nodes
- Sum of leafs
- Deepness
- A beautiful way to print output (I like the current representation)