| 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. |
© 2019-2026 Algotree.org | All rights reserved.
This content is provided for educational purposes. Feel free to learn, practice, and share knowledge.
For questions or contributions, visit algotree.org
"The only way to do great work is to love what you do. - Steve Jobs"