Breadth-First Search (BFS) Courses and Certifications

Simple Snippets

Breadth First Search (BFS) and Level Order Tree Traversal in Binary Trees - C++ Implementation

Comprehensive tutorial on Breadth First Search in binary trees, covering theory, pseudocode, and C++ implementation. Includes step-by-step explanations and practical coding examples.

• YouTube
• 50 minutes
• On-Demand
• Free Video

CodeBeauty

Data Structures - Complete Beginner's Guide to Arrays, Linked Lists, Stacks, Queues, Trees, and More

Master essential data structures from arrays to trees with hands-on C++ examples, algorithms, and STL implementations in this comprehensive beginner-friendly tutorial series.

• YouTube
• 6 hours 34 minutes
• On-Demand
• Free Video

Graph Algorithms Crash Course (with Java)

Comprehensive Java tutorial on graph algorithms, covering implementation, traversals (DFS, BFS), and Dijkstra's algorithm with practical coding examples and visual explanations.

• freeCodeCamp
• 1-2 hours
• On-Demand
• Free Video

Simple Snippets

Binary Tree Traversal Techniques - DFS vs BFS - DFS Preorder vs Inorder vs Postorder

Comprehensive guide to binary tree traversal techniques, covering DFS (pre-order, in-order, post-order) and BFS with diagrams and code examples. Ideal for understanding tree data structure algorithms.

• YouTube
• 28 minutes
• On-Demand
• Free Video

CodeBeauty

Tree Traversal Algorithms - BFS and DFS - Preorder, Inorder, Postorder

Comprehensive guide to tree traversal algorithms, covering BFS, DFS, and recursive implementations of Preorder, Inorder, and Postorder traversals for efficient binary tree searching.

• YouTube
• 21 minutes
• On-Demand
• Free Video

Great Learning

BFS and DFS in Java

Explore BFS and DFS algorithms for graph traversal in Java, covering their concepts, implementation, and practical applications in computer science and programming.

• YouTube
• 56 minutes
• On-Demand
• Free Video

USENIX

Practicably Boosting the Processing Performance of BFS-like Algorithms on Semi-External Graph System via I-O-Efficient Graph Ordering

Explores innovative techniques to enhance BFS-like algorithm performance on semi-external graph systems, focusing on I/O efficiency improvements through strategic graph data pre-processing.

• YouTube
• 15 minutes
• On-Demand
• Conference Talk

Data Structures and Algorithms (II)

全面掌握栈、队列、二叉树、图和BST的结构、算法及应用。学习实现这些数据结构，并运用于解决实际问题，如霍夫曼编码、图遍历和AVL树。

• Coursera
• 1 day 12 hours 54 minutes
• On-Demand
• Paid Course