<Table> <Tr> <Th_colspan="2"> Binary search tree </Th> </Tr> <Tr> <Th> Type </Th> <Td> tree </Td> </Tr> <Tr> <Th> Invented </Th> <Td> 1960 </Td> </Tr> <Tr> <Th> Invented by </Th> <Td> P.F. Windley, A.D. Booth, A.J.T. Colin, and T.N. Hibbard </Td> </Tr> <Tr> <Th_colspan="2"> Time complexity in big O notation </Th> </Tr> <Tr> <Td_colspan="2"> <Table> <Tr> <Th> Algorithm </Th> <Td> </Td> <Td> Average </Td> <Td> Worst Case </Td> </Tr> <Tr> <Th> Space </Th> <Td> </Td> <Td> O (n) </Td> <Td> O (n) </Td> </Tr> <Tr> <Th> Search </Th> <Td> </Td> <Td> O (log n) </Td> <Td> O (n) </Td> </Tr> <Tr> <Th> Insert </Th> <Td> </Td> <Td> O (log n) </Td> <Td> O (n) </Td> </Tr> <Tr> <Th> Delete </Th> <Td> </Td> <Td> O (log n) </Td> <Td> O (n) </Td> </Tr> </Table> </Td> </Tr> </Table> <Tr> <Th_colspan="2"> Binary search tree </Th> </Tr>

Time complexity to sort elements of binary search tree is
find me the text answering this question