Searching in a Binary Search Tree
Read OriginalThis technical article details the process of searching for a value in a Binary Search Tree (BST). It explains the core properties of a BST and provides a step-by-step walkthrough of the search algorithm, which runs in O(log N) time on average. The article contrasts recursive and iterative implementations, discussing their respective time and space complexities (O(log N) vs O(1) space), and includes code examples for a TreeNode structure.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
Fix your upgrades and migrations with Codemods
Cassidy Williams
•
2 votes
2
Designing Design Systems
TkDodo Dominik Dorfmeister
•
2 votes
3
A simple explanation of the big idea behind public key cryptography
Richard Gendal Brown
•
2 votes
4
Introducing RSC Explorer
Dan Abramov
•
1 votes
5
The Pulse: Cloudflare’s latest outage proves dangers of global configuration changes (again)
The Pragmatic Engineer Gergely Orosz
•
1 votes
6
Fragments Dec 11
Martin Fowler
•
1 votes
7
Adding Type Hints to my Blog
Daniel Feldroy
•
1 votes
8
Refactoring English: Month 12
Michael Lynch
•
1 votes
9
Converting HTTP Header Values To UTF-8 In ColdFusion
Ben Nadel
•
1 votes
10
Pausing a CSS animation with getAnimations()
Cassidy Williams
•
1 votes