Binary tree
A tree data structure with no circular references where each node contains a value and can have at most 2 children, typically named left and right.
A tree data structure with no circular references where each node contains a value and can have at most 2 children, typically named left and right.