You have already seen how data is stored in data structures such as arrays, vectors, linked lists, and stacks. When data is being organized, a programmer's highest priority is to organize it in such a way that item insertion, deletion, and lookups earches) are fast. How is the tree data structure different from the ones you have studied? Why is the Binary search tree an efficient data structure with a search time complexity of O(log N)?