Rezumat problemă

BiLatime

#759

Se consideră un arbore binar în care nodurile memorează numere naturale nenule. Să se afișeze valorile din arbore în urma parcurgerii în lățime, pornind din rădăcină.

Programul citește lista valorilor din arbore, dată în ordinea parcurgerii în preordine.

Fișiere Candale Silviu (silviu) medie

Clasa 11 Structuri de date arborescente Arbori binari

Rezolvă

Detalii

Problema	BiLatime	Operații I/O	bilatime.in/bilatime.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64424261	Utilizator	Ilie Andreea (ilieandreea26)
Fișier	bilatime.cpp	Dimensiune	662 B
Data încărcării	06 Mai 2026, 10:47	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

bilatime.cpp: In function ‘void bfs(nod*)’:
bilatime.cpp:25:11: error: no matching function for call to ‘push(nod*&)’
   25 |     q.push(r);
      |     ~~~~~~^~~
In file included from /usr/include/c++/13/queue:66,
                 from bilatime.cpp:2:
/usr/include/c++/13/bits/stl_queue.h:285:7: note: candidate: ‘void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = int; _Sequence = std::deque<int, std::allocator<int> >; value_type = int]’ (near match)
  285 |       push(const value_type& __x)
      |       ^~~~
/usr/include/c++/13/bits/stl_queue.h:285:7: note:   conversion of argument 1 would be ill-formed:
bilatime.cpp:25:12: error: invalid conversion from ‘nod*’ to ‘std::queue<int>::value_type’ {aka ‘int’} [-fpermissive]
   25 |     q.push(r);
      |            ^
      |            |
      |            nod*
/usr/include/c++/13/bits/stl_queue.h:290:7: note: candidate: ‘void std::queue<_Tp, _Sequence>::push(value_type&&) [with _Tp = int; _Sequence = std::deque<int, std::allocator<int> >; value_type = int]’ (near match)
  290 |       push(value_type&& __x)
      |       ^~~~
/usr/include/c++/13/bits/stl_queue.h:290:7: note:   conversion of argument 1 would be ill-formed:
bilatime.cpp:25:12: error: invalid conversion from ‘nod*’ to ‘std::queue<int>::value_type’ {aka ‘int’} [-fpermissive]
   25 |     q.push(r);
      |            ^
      |            |
      |            nod*
bilatime.cpp:27:25: error: invalid conversion from ‘__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type’ {aka ‘int’} to ‘nod*’ [-fpermissive]
   27 |         nod *i = q.front();
      |                  ~~~~~~~^~
      |                         |
      |                         __gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type {aka int}
bilatime.cpp:29:25: error: no matching function for call to ‘push(nod*&)’
   29 |         if(i->st) q.push(i->st);
      |                   ~~~~~~^~~~~~~
/usr/include/c++/13/bits/stl_queue.h:285:7: note: candidate: ‘void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = int; _Sequence = std::deque<int, std::allocator<int> >; value_type = int]’ (near match)
  285 |       push(const value_type& __x)
      |       ^~~~
/usr/include/c++/13/bits/stl_queue.h:285:7: note:   conversion of argument 1 would be ill-formed:
bilatime.cpp:29:29: error: invalid conversion from ‘nod*’ to ‘std::queue<int>::value_type’ {aka ‘int’} [-fpermissive]
   29 |         if(i->st) q.push(i->st);
      |                          ~~~^~
      |                             |
      |                             nod*
/usr/include/c++/13/bits/stl_queue.h:290:7: note: candidate: ‘void std::queue<_Tp, _Sequence>::push(value_type&&) [with _Tp = int; _Sequence = std::deque<int, std::allocator<int> >; value_type = int]’ (near match)
  290 |       push(value_type&& __x)
      |       ^~~~
/usr/include/c++/13/bits/stl_queue.h:290:7: note:   conversion of argument 1 would be ill-formed:
bilatime.cpp:29:29: error: invalid conversion from ‘nod*’ to ‘std::queue<int>::value_type’ {aka ‘int’} [-fpermissive]
   29 |         if(i->st) q.push(i->st);
      |                          ~~~^~
      |                             |
      |                             nod*
bilatime.cpp:30:25: error: no matching function for call to ‘push(nod*&)’
   30 |         if(i->dr) q.push(i->dr);
      |                   ~~~~~~^~~~~~~
/usr/include/c++/13/bits/stl_queue.h:285:7: note: candidate: ‘void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = int; _Sequence = std::deque<int, std::allocator<int> >; value_type = int]’ (near match)
  285 |       push(const value_type& __x)
      |       ^~~~
/usr/include/c++/13/bits/stl_queue.h:285:7: note:   conversion of argument 1 would be ill-formed:
bilatime.cpp:30:29: error: invalid conversion from ‘nod*’ to ‘std::queue<int>::value_type’ {aka ‘int’} [-fpermissive]
   30 |         if(i->dr) q.push(i->dr);
      |                          ~~~^~
      |                             |
      |                             nod*
/usr/include/c++/13/bits/stl_queue.h:290:7: note: candidate: ‘void std::queue<_Tp, _Sequence>::push(value_type&&) [with _Tp = int; _Sequence = std::deque<int, std::allocator<int> >; value_type = int]’ (near match)
  290 |       push(value_type&& __x)
      |       ^~~~
/usr/include/c++/13/bits/stl_queue.h:290:7: note:   conversion of argument 1 would be ill-formed:
bilatime.cpp:30:29: error: invalid conversion from ‘nod*’ to ‘std::queue<int>::value_type’ {aka ‘int’} [-fpermissive]
   30 |         if(i->dr) q.push(i->dr);
      |                          ~~~^~
      |                             |
      |                             nod*

Cum funcționează evaluarea?