In a balanced binary search tree, adding an element always requires approximately $0($log$2$ n$)$ steps. T$/$F