Binary Search Tree
Last updated
What is Binary Search Tree?
A binary search tree, also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree.
Free resources to learn Binary Search Tree
- CourseBinary Search Trees - Coursera
- VideoTree | Illustrated Data Structures
- VideoBinary Search Trees - MIT
- VideoBinary Search Tree Implementation in C++
- VideoBST implementation - memory allocation in stack and heap
- VideoFind Min and Max Element in Binary Search Tree
- VideoCheck if Given Tree is Binary Search Tree or Not
- VideoDelete an Element from Binary Search Tree
- VideoInorder Successor in a binary search tree
- FeedExplore top posts about General Programming
More in stage 3: Asymptotic Notation
Binary Search Tree: common questions
Can I learn Binary Search Tree in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Binary Search Tree in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Binary Search Tree tutorial for beginners?
It is lesson 23 of 188 in the free Computer Science roadmap, in stage 3, Asymptotic Notation. If you are new to Computer Science, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.