Suppose you have a doubly linked list with $K$ sorted values, in descending order. What is the Big$-0$ of removing each value from the rear of the link list and inserting into an initially empty binary search tree?

$O(1)$

O$($Log K$)$

$O(K)$

$)$

$O(K^2)$

$O(2^K)$