The binary trees project brings us closer to this concept, knowing that they are, how they are composed, their main characteristics and algorithms to navigate them.
- Binary tree (note the first line: Not to be confused with B-tree.)
- Data Structure and Algorithms - Tree
- Tree Traversal
- Binary Search Tree
- Data structures: Binary Tree
- What is a binary tree
- What is the difference between a binary tree and a Binary Search Tree
- What is the possible gain in terms of time complexity compared to linked lists
- What are the depth, the height, the size of a binary tree
- What are the different traversal methods to go through a binary tree
- What is a complete, a full, a perfect, a balanced binary tree
This project has been tested on Ubuntu 14.06.6 LTS
- The tests are carried out in virtualBox
- Development environment manager vagrant
- Programming language C
- Style guidelines: Betty Style
- Antonio Estela - student at Holberton School
- Oscar Info - student at Holberton School