Tag: Breadth First Search Algorithms

Teaching Kids Programming – Maximum Depth of N-ary Tree via Depth First Search or Breadth First Search Algorithms

November 21, 2021 algorithms, BFS, DFS, python, teaching kids programming, youtube video No Comments

Teaching Kids Programming: Videos on Data Structures and Algorithms Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path …

[Continue Reading...]

Breadth First Search Algorithm to Check Completeness of a Binary Tree?

May 21, 2019 algorithms, BFS, c / c++, data structure, java No Comments

Given a binary tree, determine if it is a complete binary tree. Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly …

[Continue Reading...]

How to Sum the Root To Leaf in Binary Numbers in a Binary Tree using Breadth First Search?

April 8, 2019 algorithms, BFS, c / c++, code, coding exercise, java No Comments

Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if the path …

[Continue Reading...]