Skip to main content

31 docs tagged with "Breadth-First Search"

View all tags

01 Matrix

This is a solution to the 542. 01 Matrix problem on LeetCode.

Binary Tree Level Order Traversal II

Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf to root).

Binary Tree Zigzag Level Order Traversal

Given a binary tree, return the zigzag level order traversal of its nodes' values. (i.e., from left to right, then right to left for the next level and alternate between).

Counting Visible Nodes in Binary Tree

Given a binary tree, count the number of visible nodes. A node is considered visible if, in the path from the root to that node, there are no nodes with a greater value.

Course Schedule

This document provides a solution to the Course Schedule problem.

Even Odd Tree (LeetCode)

Determine if a binary tree is an "even-odd" tree, where the level of nodes alternates between odd and even values.

Flood Fill

This is a solution to the Flood Fill problem on LeetCode.

K-Similar Strings

Determine the minimum number of adjacent letter swaps needed to transform string s1 into string s2, given that s1 and s2 are anagrams.

Merge Two Binary Trees

Given two binary trees, merge them into a new binary tree by adding the values of overlapping nodes.

Open the Lock

This is a solution to the Open the Lock problem on LeetCode.