Computer Science · Data Structures
In a Binary Search Tree (BST) where nodes store stock prices, inserting a new price smaller than the current minimum requires traversing from the root to the leftmost leaf. What is the worst-case time complexity for this insertion operation if the tree is highly skewed due to sorted input data?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n log n)
- 2O(n)✓
- 3O(log n)
- 4O(1)
Correct answer
O(n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures MCQs →Want more practice questions on Data Structures?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures