A binary tree is a useful data structure when 2 way decisions must be made at each point in a process.
A binary tree is a useful data structure when 2 way decisions must be made at each point in a process.
Constructing a binary search tree is also an efficient way to check for duplicate values.
Traversing a binary tree is more complicated than traversing a linked list, because each node has two branches; this branching poses a problem for searching the tree. Recursion, however, can overcome this.