Tagged articles
tree traversal
12 articles · Page 1 of 1
This article explains binary tree representation in Java and demonstrates recursive pre-order, in-order, post-order, and iterative level-order traversals, plus methods to create a full binary tree, count nodes, compute height, and count leaf nodes with complete runnable code.
AlgorithmJavaQueue
0 likes · 9 min read


liandkSep 2, 2026 · Fundamentals
This article introduces binary trees, explains key terminology and four common tree shapes, details four traversal methods, provides a complete Python implementation with sample output, and highlights real‑world uses and beginner pitfalls.
Pythonbinary treedata structures
0 likes · 7 min read

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.
AlgorithmCode ExampleJava
0 likes · 7 min read

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.
AlgorithmPHPPre-order
0 likes · 9 min read

This article introduces binary trees, explains their Java representation, demonstrates pre-order, in-order, post-order, and level-order traversals, and provides implementations for creating full binary trees, counting nodes, computing height, and counting leaf nodes, complete with sample code and usage examples.
AlgorithmJavabinary tree
0 likes · 10 min read

This article explains how to use the nested set model to efficiently query, count, and manage hierarchical department data in MySQL, covering recursive retrieval, leaf detection, insertion, deletion, and traversal techniques with practical SQL examples and JavaScript code for building tree structures.
MySQLNested Set ModelSQL
0 likes · 11 min read

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.
AlgorithmsComplexityGraph Algorithms
0 likes · 33 min read

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

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

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.
AlgorithmC++binary search tree
0 likes · 13 min read


ITPUBMar 24, 2017 · Fundamentals
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 treedata-structuresinsertion-deletion
0 likes · 16 min read


ITPUBMar 24, 2017 · Fundamentals
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.
Insertionbinary search treedata-structures
0 likes · 16 min read
