Binary tree search algorithm

A binary tree search algorithm is a technique for efficienctly searching through a large amount of data often implemented in computer programming. It's also used with bi-logic traps to quickly whittle down to the correct answer progressively.

Usage
Usually a computer program will take a large amount of information, and divide it in half, and query if the answer is in one half or the other. If the answer is in one half, it splits that half into another half and queries which half has the data.

Eventually it will work it's way to the correct answer or data term in the fewest movements.

For example, if you were searching in a two-floor building and you knew for sure the item you was looking for was only in one particular floor, this would be a type of binary search (because you have divided the house into 'two' (floors) and thus limited your search to one floor and thus saved yourself the unnecessary work of searching the wrong floor).