C - Binary trees A binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child.
In C programming language, binary trees can be implemented using pointers. Each node in the binary tree is represented by a structure that contains a data element and two pointers, one for the left child and one for the right child.
RESOURCES
- https://en.wikipedia.org/wiki/Binary_tree
- https://www.tutorialspoint.com/data_structures_algorithms/tree_data_structure.htm
- https://www.programiz.com/dsa/tree-traversal
- https://en.wikipedia.org/wiki/Binary_search_tree
- https://www.youtube.com/watch?v=H5JubkIy_p8&ab_channel=mycodeschool
- https://www.youtube.com/watch?v=pYT9F8_LFTM&ab_channel=mycodeschool