PG entrance exam CUET PG 2025 Mock Test Programming and Data Structure Binary Heap Binary Search Tree

The worst case complexity for searching an element in binary search tree is:

1
O(lgn)
2
O(nlogn)
3
O(n2 )
4
O(n)
Share: WhatsApp Telegram X

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Other Tools: chatwiz.hivanix.in mmspace.hivanix.in unogame.hivanix.in

Quick Navigation

Home

Subjects

Chapters