give big theta bound for the worst case runtime of addAll and explain reasoning

public TernarySearchTreeAutocomplete() { overall Root = null; ) 9 public void addAll(Collection extends CharSequence> terms) { for (CharSequence term : terms) { overaltRoot = put(overaltRoot, term, false, "); 14 15 } 18 private Node put (Node x, CharSequence term, boolean isterm, int t) { char c = term.charAt(1); if (x = null) { x = new Node (c, false); X.data = 0; ) if (c X.data) X.right = put(.right, term, is Term, 1); else if (i