CacheDB: 2026-04-06 11:48:41

1466-percurso-em-arvore-por-nivel

percurso-em-arvore-por-nivel

C Difficulty

README.md Preview

# 1466 — Percurso em Árvore por Nível

**Autor:** Neilor Tonin, URI Brasil  
**Origem:** Beecrowd 1466  
**Dificuldade:** C (Estruturas Clássicas)  
**Complexidade:** O(N²) pior caso, O(N log N) caso médio

## Descrição

Dada uma sequência de N inteiros distintos, inseri-los em uma Árvore Binária de Busca (BST) e imprimir o percurso por nível (BFS — Breadth-First Search).

## Estrutura

```
workspace/1466-percurso-em-arvore-por-nivel/
├── metadata.yaml
├── README.md
├── ANALYSIS.md
├── editorial/
│   └── editorial_percurso-em-arvore-por-nivel.tex
├── statements/
│   └── a-percurso-em-arvore-por-nivel/
│       ├── a_pt_percurso-em-arvore-por-nivel.md
│       ├── b_pt_percurso-em-arvore-por-nivel.md
│       ├── c_pt_percurso-em-arvore-por-nivel.md
│       └── d_pt_percurso-em-arvore-por-nivel.md
├── solutions/
│   └── a-otima-basica/
│       ├── percurso.cpp
│       ├── percurso.py
│       └── Percurso.java
└── test-cases/
    ├── a-performance/    (5 testes)
    ├── b-edge-cases/     (5 testes)
    ├── c-bst-structure/  (5 testes)
    └── d-sample/         (5 testes)
```

## Soluções

| Linguagem | Arquivo | Paradigma |
|-----------|---------|-----------|
| C++       | percurso.cpp | Imperativo |
| Python    | percurso.py  | Imperativo |
| Java      | Percurso.java | OO |

## Validação

Todas as 3 soluções foram validadas contra os 20 casos de teste com 100% de acerto.

Actions

Workflow do Problema

Local Workspace

Pasta criada no disco
Metadados

Informações básicas preenchidas
Validação

Soluções passam nos testes
4

Sincronização

Enviado para DB e GitLab

Components

Statements ✅
Solutions 1 ✅
Test Cases 20 ✅

Database Info

DB ID 1466

Name Percurso em Árvore por Nível

Time Limit 1.0s

Mem Limit 250 MB

Version 0.8

Difficulty Level O

Test Cases 0

🚀 Quick Prompts

Structure Scaffolding

Generate metadata & folder structure

ID: 1.1

Context & Description

Draft description & editorial

ID: 1.2

Statements List

⚠️

Warning: The defaultStatement defined in metadata (a-percurso-em-arvore-por-nivel) was not found in the file system.

ID	Level	Natural Languages	Skills	Status	Action
a-percurso-em-arvore-por-nivel	A	a b c d	trees, busca-largura	⚠️

Statement Details

Select a statement above to view details.

Actions

Statistics

1 Total Statements

By Type (ID)

a-percurso-em-arvore-por-nivel 1

By Level

Level A 1

🚀 Quick Prompts

Statement Analysis

Analyze ambiguity & clarity

ID: 2.1

WOK Statement Generation

Rewrite in WOK Universe theme

ID: 2.2

Statement Expansion

Expand to 4 difficulty levels

ID: 2.3

Testcase Scenarios Sync

YAML Source vs Database

Slug	Level	Name	Type	Skills	Status	Actions
`a-performance`	A	Árvores Grandes Casos com N=500 e C=10 árvores por teste.	PERFORMANCE	trees 1pts	Not in DB	Details
`b-edge-cases`	B	Casos Degenerados Árvores degeneradas (linha reta), nó único, dois nós.	TDD	trees 1pts	Not in DB	Details
`c-bst-structure`	C	Estruturas Variadas de BST Zig-zag, balanceada, valores grandes, raiz zero.	TDD	busca-largura 1pts	Not in DB	Details
`d-sample`	D	Exemplo Casos base do enunciado.	TDD	trees 1pts	Not in DB	Details

Local Test Cases (Disk)

Scenario: a-performance 5 cases

Name	Files (Input / Output)	Actions
performance-01 📄 📷	Input `performance-01.in` f214df1cda4c54aeebb7ecc801395fd7 Output `performance-01.out` 4abf46e02ca039fabb8f83c14ec8643a	🔍 Details
performance-02 📄 📷	Input `performance-02.in` 8e39fd380886e6a27839505b6a72fafc Output `performance-02.out` d8b45e835a02009600577a070d047953	🔍 Details
performance-03 📄 📷	Input `performance-03.in` 24844f5059e52811249a81072e59c7fb Output `performance-03.out` 2103842cebd18f9632ed35785278fb92	🔍 Details
performance-04 📄 📷	Input `performance-04.in` c18c2599c62d000c171cbcdbd2bd69f4 Output `performance-04.out` 6a7227322e91bae21ea28c5327ac992f	🔍 Details
performance-05 📄 📷	Input `performance-05.in` 13fc70685241706bfdc45118f8b2990f Output `performance-05.out` 240575f122f230689867938f2001b114	🔍 Details

Scenario: b-edge-cases 5 cases

Name	Files (Input / Output)	Actions
edge-01 📄 📷	Input `edge-01.in` 6a840ad0775b34a16c6507efd01a7ace Output `edge-01.out` 1417c3829857ca16a9770ddac81844f2	🔍 Details
edge-02 📄 📷	Input `edge-02.in` 5d95ddae9e904dd2b3c2eca2004a4a2d Output `edge-02.out` dd42b79a597b9790c25130fd0ff66a43	🔍 Details
edge-03 📄 📷	Input `edge-03.in` a5ecad469ffde4b3fd26830b81983c19 Output `edge-03.out` a4d411ae2c46a9cf9a93b47a5529a9dc	🔍 Details
edge-04 📄 📷	Input `edge-04.in` 63a5c3c2c0a2b7b8d4a128f398550bb6 Output `edge-04.out` b042ce07532b32c9f8f8b4b4ab668ad2	🔍 Details
edge-05 📄 📷	Input `edge-05.in` d00b2c309d8358c1e9d7a3cc29043622 Output `edge-05.out` 74d0f22ff7f2c34eafb52dfc0569196b	🔍 Details

Scenario: c-bst-structure 5 cases

Name	Files (Input / Output)	Actions
structure-01 📄 📷	Input `structure-01.in` 0868bf3917218fe7c04dcf2510652790 Output `structure-01.out` e1887aa3c746f41fbec051677d40145e	🔍 Details
structure-02 📄 📷	Input `structure-02.in` c5c06065c1b50c955cff1afca8018f42 Output `structure-02.out` 56a916a41b19e4829b0f508add063583	🔍 Details
structure-03 📄 📷	Input `structure-03.in` 02ec6f83d985649ddd15950a82bfc8d7 Output `structure-03.out` e3f8c55f9c06b18456e9ce766dd27cc9	🔍 Details
structure-04 📄 📷	Input `structure-04.in` cf46752eedd2808875575db8e6b6522d Output `structure-04.out` 3f374712e1cfb97a01ced120db4fd2dc	🔍 Details
structure-05 📄 📷	Input `structure-05.in` 639d7c1d68992098747a2a386026cc72 Output `structure-05.out` ecf3aa7bf850fcd20c5d133e0eb1d864	🔍 Details

Scenario: d-sample 5 cases

Name	Files (Input / Output)	Actions
sample-01 📄 📷	Input `sample-01.in` cafeac88a90023bdbebaa37350c63e99 Output `sample-01.out` fa2303bb9d527fc3feedbfbc91491985	🔍 Details
sample-02 📄 📷	Input `sample-02.in` 280262bb00bfccfa4c24774d8faccde2 Output `sample-02.out` 6d1c86165f82a623b5da7fbb8c6abbc6	🔍 Details
sample-03 📄 📷	Input `sample-03.in` 23f3d7d68e128ad9dd80a10c555543cc Output `sample-03.out` 1d693efedfdc9ed1885ec9ea2159f0c6	🔍 Details
sample-04 📄 📷	Input `sample-04.in` 976a04ae41c08f96ff55b2fb44832689 Output `sample-04.out` 83611774802e46301b9fc35c89e67d30	🔍 Details
sample-05 📄 📷	Input `sample-05.in` 44539bd2aa8c694b9c75644cdca3e690 Output `sample-05.out` ff340b31040e7bddc026309312441497	🔍 Details

📊 Sync Statistics

Total (Disk) 20

Total (Database) 0

✓ Synchronized 0

⚠ Desynchronized 20

Duplicates (MD5)

Duplicates in (MD5) 0

Desync = (DB missing on Disk) + (Disk missing on DB)

Actions

BST Recursiva + BFS Iterativo

ID: a-otima-basica

Inserção recursiva padrão em BST seguida de travessia BFS com fila.

Implementations

Solutions Check Report

## Solutions Check Report (Detalhado / Debug)
**Generated**: 2026-06-01T17:50:54.476924
**Solution**: `solutions/a-otima-basica/percurso.py`

### Compilation
✅ No compilation needed

### Resultados

<table class="results-table"><thead><tr><th>Test Case</th><th>Result</th><th>Time (s)</th></tr></thead><tbody>
<tr class="scenario-row"><td colspan="3"><strong>a-performance - Performance</strong></td></tr>
<tr id="row-a-performance-performance-01-in"><td>performance-01.in</td><td>✅ PASS</td><td>0.015</td></tr>
<tr id="row-a-performance-performance-02-in"><td>performance-02.in</td><td>✅ PASS</td><td>0.016</td></tr>
<tr id="row-a-performance-performance-03-in"><td>performance-03.in</td><td>✅ PASS</td><td>0.015</td></tr>
<tr id="row-a-performance-performance-04-in"><td>performance-04.in</td><td>✅ PASS</td><td>0.016</td></tr>
<tr id="row-a-performance-performance-05-in"><td>performance-05.in</td><td>✅ PASS</td><td>0.016</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>b-edge-cases - TDD</strong></td></tr>
<tr id="row-b-edge-cases-edge-01-in"><td>edge-01.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-b-edge-cases-edge-02-in"><td>edge-02.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-b-edge-cases-edge-03-in"><td>edge-03.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-b-edge-cases-edge-04-in"><td>edge-04.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-b-edge-cases-edge-05-in"><td>edge-05.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>c-bst-structure - TDD</strong></td></tr>
<tr id="row-c-bst-structure-structure-01-in"><td>structure-01.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-c-bst-structure-structure-02-in"><td>structure-02.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-c-bst-structure-structure-03-in"><td>structure-03.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-c-bst-structure-structure-04-in"><td>structure-04.in</td><td>✅ PASS</td><td>0.012</td></tr>
<tr id="row-c-bst-structure-structure-05-in"><td>structure-05.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr class="scenario-row"><td colspan="3"><strong>d-sample - TDD</strong></td></tr>
<tr id="row-d-sample-sample-01-in"><td>sample-01.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-d-sample-sample-02-in"><td>sample-02.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-d-sample-sample-03-in"><td>sample-03.in</td><td>✅ PASS</td><td>0.014</td></tr>
<tr id="row-d-sample-sample-04-in"><td>sample-04.in</td><td>✅ PASS</td><td>0.013</td></tr>
<tr id="row-d-sample-sample-05-in"><td>sample-05.in</td><td>✅ PASS</td><td>0.013</td></tr>
</tbody></table>

✅ Verification

Validate your solutions against test cases using the metadata rules.

🚀 Quick Prompts

Solution Generation

Create Optimal/Sub-optimal code

ID: 3.1

📄 Enunciados

A 1

Idiomas: pt

💡 Soluções

cpp: 1 py: 1 java: 1

✅ 0 ❌ 0

🧪 Casos de Teste

4 Scen.

Total no Disco 20

Total no Banco 0

Sincronização 0.0%

Metadata (form)

Version

Name

Slug

ID Beecrowd

Difficulty

Time Complexity

Space Complexity

Time Limit (s)

Memory Limit (MB)

Origin

Author (Problem)

Author (Editorial)

Default Statement

Topics

Skills

Description

Editorial

Success message

metadata.yaml

# yaml-language-server: $schema=https://api.mundodocodigo.com.br/api/public/json/wok-problem.json --- version: "1.0" id: 1466 name: "Percurso em Árvore por Nível" slug: "percurso-em-arvore-por-nivel" author: "Por Neilor Tonin, URI Brasil" origin: "Beecrowd 1466" timelimit: 2.0 memlimit: 256 difficultyLevelId: C description: "Dada uma sequência de N inteiros distintos, inseri-los em uma BST e imprimir o percurso por nível (BFS)." editorial: | A solução consiste em duas etapas: 1. Inserção sequencial dos valores em uma Árvore Binária de Busca (BST). 2. Travessia por nível usando BFS (fila). A cada desenfileiramento, imprime-se o valor e enfileira-se os filhos esquerdo e direito. No pior caso (entrada já ordenada), a árvore degenerada tem altura N, resultando em O(N²) para construção. No caso médio, O(N log N). successmsg: "Parabéns! Você dominou inserção em BST e travessia BFS por nível — operações fundamentais em estruturas não-lineares." timeComplexity: "O(N²)" skills: - trees - busca-largura - queues statements: - id: a-percurso-em-arvore-por-nivel testScenarioLevel: A thematicSkills: - skill: trees points: 1 - skill: busca-largura points: 1 testScenarios: - id: a-performance name: Árvores Grandes description: "Casos com N=500 e C=10 árvores por teste." helpTip: "Com N=500, O(N²) para construção é aceitável dentro de 2s." level: A testType: PERFORMANCE skills: - skill: trees points: 1 - id: b-edge-cases name: Casos Degenerados description: "Árvores degeneradas (linha reta), nó único, dois nós." helpTip: "O que acontece quando a entrada está ordenada de forma crescente?" level: B testType: TDD skills: - skill: trees points: 1 - id: c-bst-structure name: Estruturas Variadas de BST description: "Zig-zag, balanceada, valores grandes, raiz zero." helpTip: "Verifique se o insert está respeitando a regra < esquerda, >= direita." level: C testType: TDD skills: - skill: busca-largura points: 1 - id: d-sample name: Exemplo description: "Casos base do enunciado." helpTip: "Confira a formatação: sem espaço após o último número, linha em branco após cada caso." level: D testType: TDD skills: - skill: trees points: 1 solutions: - id: a-otima-basica name: BST Recursiva + BFS Iterativo description: "Inserção recursiva padrão em BST seguida de travessia BFS com fila." level: A implementations: - language: cpp paradigm: Imperative main: percurso.cpp filenames: - percurso.cpp - language: py paradigm: Imperative main: percurso.py filenames: - percurso.py - language: java paradigm: OO main: Percurso filenames: - Percurso.java authorSlugProblem: Unknown defaultStatement: a-percurso-em-arvore-por-nivel

1466-percurso-em-arvore-por-nivel

README.md Preview

Actions

Workflow do Problema

Local Workspace

Metadados

Validação

Sincronização

Components

Database Info

🚀 Quick Prompts

Statements List

Statement Details

Actions

Statistics

By Type (ID)

By Level

🚀 Quick Prompts

📊 Sync Statistics

Actions

Test Case Details

Testcase Scenarios Sync

Local Test Cases (Disk)

Scenario: a-performance 5 cases

Scenario: b-edge-cases 5 cases

Scenario: c-bst-structure 5 cases

Scenario: d-sample 5 cases

📊 Sync Statistics

Actions

BST Recursiva + BFS Iterativo

Implementations

Solutions Check Report

✅ Verification

🚀 Quick Prompts

📄 Enunciados

💡 Soluções

🧪 Casos de Teste

Metadata (form)

Git Status

Git Workflow

Problem Analysis Report

🛠️ Validation Tools

✅ Synced with API

✅ Synced with Database

Actions

📋 Processo de Criação

Select a Prompt

📤 API Synchronization

📄 Recreating README.md...

💻 Git Action Output

Running Verification...

Ajuda

📄 Sync Statements to DB

🚀 Batch Auto-Link Process

⬇️ Repo Sync Output

📝 Update Manifest Output

Ajuda