Master programming syntax, solve interactive challenges & run live code in Syntaxis Explore Arena →

menu_book Course Curriculum (Data Structures & Algorithms) expand_more

Complexity & Foundations

Big O notation Big Omega notation Big Theta notation Constant time Logarithmic time Linear time Quadratic time Amortized analysis Space complexity Recursion stack

Arrays & Strings

Array traversal Array insertion Array deletion Two pointers Sliding window Prefix sums String reversal Palindrome check Frequency counting Matrix traversal

Linked Lists

Singly linked list Linked list insertion Linked list deletion Reverse linked list Find middle node Detect cycle Merge sorted lists Doubly linked list Circular linked list LRU list concept

Stacks & Queues

Stack push pop Balanced parentheses Monotonic stack Queue enqueue dequeue Circular queue Deque Priority queue concept Breadth-first queue Min stack Evaluate postfix expression

Hashing

Hash map lookup Hash set membership Two sum Group anagrams First unique character Collision concept Load factor concept Open addressing concept Separate chaining concept Memoization with hash map

Trees & Heaps

Binary tree traversal Preorder traversal Inorder traversal Postorder traversal Level order traversal Binary search tree search BST insertion Tree height Min heap Heap sort

Graphs

Adjacency list Adjacency matrix Depth-first search Breadth-first search Connected components Cycle detection directed graph Topological sort Dijkstra shortest path Union find Minimum spanning tree concept

Sorting Searching & DP

Bubble sort Insertion sort Selection sort Merge sort Quick sort Binary search Lower bound Dynamic programming Fibonacci 0 1 knapsack Longest increasing subsequence

Data Structures & Algorithms / Trees & Heaps

BST insertion

Learn BST insertion in Data Structures & Algorithms with a focused explanation, a topic-specific example, edge guidance, and a mastery check.

12 min read • Intermediate

data-structures-algorithms-057.py

python

class Node:
    def __init__(self,v):self.v,self.l,self.r=v,None,None
def insert(n,x):
    if not n:return Node(x)
    if x<n.v:n.l=insert(n.l,x)
    elif x>n.v:n.r=insert(n.r,x)
    return n
root=None
for x in [8,3,10,6]:root=insert(root,x)
print(root.l.r.v)

What to watch

Content source & attribution

Original Syntaxis Content · Original Syntaxis Content

Lesson quizzes

BST insertion Mastery Check →

Binary search tree search