Blog

Your dream job? Lets Git IT.
Interactive technical interview preparation platform designed for modern developers.

XGitHub

Platform

  • Categories

Resources

  • Blog
  • About the app
  • FAQ
  • Feedback

Legal

  • Privacy Policy
  • Terms of Service

© 2025 LetsGit.IT. All rights reserved.

LetsGit.IT/Categories/Data Structures
Data Structuresmedium

Binary heap vs binary search tree: which operations are efficient?

Tags
#heap#bst#priority-queue#search
Back to categoryPractice quiz

Answer

A binary heap is great for min/max: peek is O(1) and insert/extract is O(log n). A (balanced) BST supports ordered traversal and search by key in O(log n). Heaps are not good for fast search or range queries.

Related questions

Data Structures
What operations does a priority queue support and how is it typically implemented?
#priority-queue#heap#ordering
Data Structures
Building a heap from an array: why can it be O(n), not O(n log n)?
#heap#heapify#complexity
Data Structures
B-tree vs binary search tree — why are B-trees common on disk?
#b-tree
#bst
#disk-io
Data Structures
What is the heap property in a binary heap?
#heap#binary-heap#priority-queue
Data Structures
What is a priority queue?
#priority-queue#heap#big-o
MongoDB
Text indexes: when would you use them and what’s a limitation?
#mongo#text-index#search