BestHub
Sign in
Tagged articles
10 articles
Page 1 of 1
Java Captain
Java Captain
Apr 23, 2025 · Fundamentals

Understanding Recursion in Java: Concepts, Pros/Cons, and Practical Examples

This article explains the fundamentals of recursion in Java, covering its definition, advantages and disadvantages, differences from iteration, and provides practical examples such as traversing comment and department trees, along with code snippets, performance considerations, and improvement strategies using depth control and Stream API.

Code ExampleJavaRecursion
0 likes · 7 min read
Understanding Recursion in Java: Concepts, Pros/Cons, and Practical Examples
php Courses
php Courses
Apr 9, 2025 · Fundamentals

Pre-order Traversal in PHP: Recursive, Iterative, and Interactive Implementations

This article explains the concept of pre-order (root-left-right) tree traversal, demonstrates how to represent binary trees in PHP, provides recursive and stack‑based iterative implementations, and includes an interactive script that lets users build a tree and choose traversal methods, with full example code.

IterativePHPPre-order
0 likes · 9 min read
Pre-order Traversal in PHP: Recursive, Iterative, and Interactive Implementations
Intelligent Backend & Architecture
Intelligent Backend & Architecture
May 24, 2021 · Fundamentals

Master Data Structures & Algorithms: Comprehensive Guide with Visual Tools

This article provides a comprehensive overview of data structures and algorithms, covering fundamental concepts such as data, elements, objects, logical and storage structures, common structures like lists, stacks, queues, trees, graphs, algorithm design techniques, complexity analysis, and includes visual resources and code examples.

AlgorithmsData StructuresQueue
0 likes · 33 min read
Master Data Structures & Algorithms: Comprehensive Guide with Visual Tools
Wukong Talks Architecture
Wukong Talks Architecture
Mar 11, 2021 · Fundamentals

A Plain-Language Introduction to Binary Trees

This article uses the occasion of Tree‑Planting Day to explain binary trees in simple terms, covering their definition, node types, degree, levels, five tree shapes, traversal methods (pre‑order, in‑order, post‑order, level‑order), advantages, drawbacks, and a brief comparison with binary search.

algorithmbinary treefundamentals
0 likes · 9 min read
A Plain-Language Introduction to Binary Trees
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
Selected Java Interview Questions
Selected Java Interview Questions
Feb 6, 2020 · Fundamentals

Binary Search Tree (BST) Overview, Implementation, and Traversal in C

This article introduces the concept of trees and binary search trees, defines a C struct for tree nodes, and provides complete implementations for creating nodes, inserting, deleting, searching, finding min/max, computing size and height, as well as recursive and non‑recursive traversals including pre‑order, in‑order, post‑order and level‑order.

Binary Search TreeCData Structures
0 likes · 13 min read
Binary Search Tree (BST) Overview, Implementation, and Traversal in C
ITPUB
ITPUB
Mar 24, 2017 · Fundamentals

Master Binary Search Trees: Definitions, Traversals, and Core Operations

Binary Search Trees (BST) are ordered binary trees that enable fast search, insertion, and deletion of nodes; this guide explains their definition, properties, traversal methods, and core operations—including search, minimum/maximum, successor/predecessor, insertion, and deletion—complete with pseudocode and illustrative examples.

Binary Search TreeSearchdata-structures
0 likes · 16 min read
Master Binary Search Trees: Definitions, Traversals, and Core Operations
ITPUB
ITPUB
Mar 24, 2017 · Fundamentals

Master Binary Search Trees: Definitions, Traversals, and Core Operations

Binary Search Trees (BST) are ordered binary trees that enable fast search, insertion, and deletion of nodes; this guide explains their definition, key properties, traversal methods, and core algorithms—including search, minimum/maximum, successor/predecessor, insertion, and deletion—with pseudocode and illustrative examples.

Binary Search TreeDeletionInsertion
0 likes · 16 min read
Master Binary Search Trees: Definitions, Traversals, and Core Operations