Rezumat problemă

BiNefrunze1

#792

Se consideră un arbore binar în care nodurile memorează numere naturale nenule. Să se afișeze valorile memorate în nodurile neterminale ale arborelui, în ordine descrescătoare.

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	BiNefrunze1	Operații I/O	binefrunze1.in/binefrunze1.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#50667721	Utilizator	Avram Alexandru (oDaiCuAvram)
Fișier	binefrunze1.cpp	Dimensiune	932 B
Data încărcării	19 Aprilie 2024, 12:47	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from binefrunze1.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = int*; _Tp = int; _Compare = main()::__lambda0]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*; _Size = int; _Compare = main()::__lambda0]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = main()::__lambda0]'
binefrunze1.cpp:48:11:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (int&, const int&)'
    while (__comp(*__first, __pivot))
                                   ^
binefrunze1.cpp:46:31: note: candidates are:
     sort(noduri, noduri + l, [](int &e1, int &e2){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from binefrunze1.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(int&, int&) <conversion>
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note:   candidate expects 3 arguments, 3 provided
binefrunze1.cpp:46:49: note: main()::__lambda0
     sort(noduri, noduri + l, [](int &e1, int &e2){

                                                 ^
binefrunze1.cpp:46:49: note:   no known conversion for argument 2 from 'const int' to 'int&'
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from binefrunze1.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const int&, int&)'
    while (__comp(__pivot, *__last))
                                  ^
binefrunze1.cpp:46:31: note: candidates are:
     sort(noduri, noduri + l, [](int &e1, int &e2){

                               ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from binefrunze1.cpp:3:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(int&, int&) <conversion>
    while (__comp(__pivot, *__last))
                                  ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note:   candidate expects 3 arguments, 3 provided
binefrunze1.cpp:46:49: note: main()::__lambda0
     sort(noduri, noduri + l, [](int &e1, int &e2){

                                                 ^
binefrunze1.cpp:46:49: note:   no known conversion for argument 1 from 'const int' to 'int&'

Cum funcționează evaluarea?