What is a binary tree? What is the time efficiency when searching a balanced binary tree of size n nodes and why? What is the advantage of using a binary tree rather than an ordinary list?

A binary tree is a special type of tree with one source node (no parents) and each node has a maximum of two child nodesEach node stores a valueUsed to store sorted numerical dataTime efficiency is O(logn)This is because the 'list' is halved each time a comparison is madeYou would need to iterate through the whole list O(n) each time a new number is added to the listIn a binary tree a new value could be added with O(logn) efficiency (less comparisons)