BestHub
Sign in
Tagged articles

BST

3 articles · Page 1 of 1
liandk
liandk
Sep 2, 2026 · Fundamentals

Binary Search Tree (BST): Fast Search Using the Left‑Small Right‑Large Rule

This article explains binary search trees (BST), detailing their left‑small right‑large ordering rule, core properties, and why they outperform ordinary binary trees with O(log n) search, while covering insertion, search, deletion, in‑order traversal code in Python, common pitfalls, and real‑world use cases.

AlgorithmsBSTData Structures
0 likes · 8 min read
Binary Search Tree (BST): Fast Search Using the Left‑Small Right‑Large Rule
Mike Chen's Internet Architecture
Mike Chen's Internet Architecture
Apr 24, 2020 · Fundamentals

Comprehensive Introduction to Binary Trees in Java

This article provides a detailed overview of binary trees, covering their definition, traversal methods, various types such as full, complete, BST, and AVL trees, along with their characteristics, advantages, disadvantages, and time‑complexity considerations for Java developers.

AVLAlgorithmsBST
0 likes · 7 min read
Comprehensive Introduction to Binary Trees in Java