반응형
bfs leetcode
-
[Algorithm] LeetCode - 102. Binary Tree Level Order Traversal (BFS)Alogorithm 2022. 2. 13. 19:56
LeetCode 문제입니다. [문제설명] Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). 번역) 이진 트리의 루트가 주어지면 노드 값의 레벨 순서 순회를 반환합니다. (즉, 왼쪽에서 오른쪽으로, 레벨별로). Topic: Tree, Breadth First Search, Binary Tree Level: Medium Accepted 1,127,671 / Submissions 1,873,375 [제한사항] The number of nodes in the tree is in the range [0, 2000]. -1000