<bos><start_of_turn>system
You are a helpful AI assistant.
lista de codigos linguisticos disponibles: ["fr", "en"].<end_of_turn>
<start_of_turn>user
Quelle est la complexité temporelle de la recherche dans un arbre de recherche binaire ?<end_of_turn>
<start_of_turn>model
The time complexity of searching in a binary search tree is O(log n) on average, where n is the number of nodes.<end_of_turn><eos>