Question
In a perfectly balanced Binary Search Tree with N nodes,
what is the worst-case time complexity for searching for an element?Solution
In a perfectly balanced BST, the height of the tree is approximately log N. Since search operations traverse a path from the root to a leaf, the worst-case time complexity is proportional to the height, hence O(log N).
If in the Shraddha University, 40% of the students (boys + girls) who completed the course got the job, then how many students got the job?
Find the discount % and profit % of Pullover
If in the city Q, 30% of the candidates who appeared got selected, and then find the number of selected candidates?
Find the profit % of Shirt if the % discount of Shirt is equal to % discount of Jacket and the C.P of Shirt is 1.5 times the C.P of Pullover?
In 2012, the respective ratio of number of employees to the promoted employees was 25 : 13. Number of female who got promoted constitutes approximately ...
Two cars Q and S start from the destination I at 8 am and 9 am respectively and they are going to the same destination. At what time car S will cross ca...
What is the difference between M.P and S.P of Jacket?Â
By what percent is the distance between the destination II and V is less than that between the destination IV and VII?
In 2015, if the number of females who got promoted was 357, what was the respective ratio of the number of male employees who got promoted and number of...
In 2013, the difference between the profit shares of Moti and Panna is Rs 1300 and the profit share of Heera is Rs 10400. If the investment of Heera is ...
