Worst case for binary search tree -O(n)
Best case for binary search tree -O(1)
<u>Explanation:</u>
The Binary search tree is the special type of binary tree. There are two child node
- Left child node
- Right child node
- In that, the right child node has a value greater than it’s the parent node. The left child node has value less than it’s the parent node.
- In the below fig. for inserting element 0, it must be inserted as the left child of 1. Therefore, for sorting we have traveled in reverse order from (3,2,1) this is the worst-case complexity O(n).
Answer:
cPanel
Explanation:
it helps you to create the website that fits your needs regardless of your experience level. This control panel software is common among Web hosts and includes many features that enable you to craft an informative or helpful website for your consumers and associates.
Answer:
D. Crowdsourcing
Explanation:
Crowdsourcing can be defined as a collaborative process which typically involves completing a project (task) and solving a problem through a group of people (crowd) that are geographically dispersed over the internet.
Basically, crowdsourcing refers to an outsourcing technique which allows a project or task to be jointly completed by a group of people (crowd) such as volunteers or freelancers who are made to work remotely over the internet.
<em>In this scenario, an online music provider such as Pandora or Jango uses crowdsourcing for collaborative filtering, which helps define the list of songs available to listeners. </em>
Answer:
WooW We Have To All This Which Class can you Please tell
