Answered

true or false: in the worst case, adding an element to a binary search tree is faster than adding it to a linked list that has both head and tail pointers/references.

Answer :

At its heart, a binary tree is a general case of a linked list. In a linked list, every node has one next reference and in a binary tree its two children can be interpreted as two next references.

In the worst case, both data structures will have the same time complexity to perform a search (linear time).

This is because it is possible for the binary tree takes on the form of a chain, which structurally is a linked list.

Now to our question, assuming you prevent the above situation from happening and the binary tree satisfies the binary search tree (BST) property .


To know more about binary tree click here:

https://brainly.in/question/1155425


#SPJ4

Go Question: Other Questions