Binary Search Tree (BST)

Medium

A binary tree following left < parent < right rule.

TreeSearchBST

A Binary Search Tree (BST) is a binary tree where every node satisfies "left child < parent < right child".

1/12

A tree following the rule: left child < parent < right child.

Basics

A Binary Search Tree (BST) is a binary tree where every node satisfies "left child < parent < right child".

Best

O(log n)

Average

O(log n)

Worst

O(n)

Space Complexity

O(n)

Binary Search Tree (BST) | AlgoNote