| Tree Type | Algorithm | Time Complexity |
|---|---|---|
| Binary Search Tree | Searching a binary search tree | Worst-case : O (N) / O (Height), when the tree is linear. Best-case : O(log N), when the tree is balanced. |
| Binary Search Tree | Validating a binary search tree | O (N) |
| Binary Search Tree | Inserting into a binary search tree | For inserting a single node Worst-case : O (N) / O (Height), when the tree is linear. Best-case : O (log N), when the tree is balanced. |