- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees ♣
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Algorithms
Machine Learning
Data Structures / Binary Search Trees »
A tree is the structure with nodes and links. A binary tree is a tree where each node has 0-2 children. A BST is a binary tree with constrains. Left node has descendants less than the node. Right node has descendants greater than the node.
What is a tree? What is a binary tree? What is a binary search tree (BST)? What are the constrains for descendants in a BST?
Click to Flip Card
