Compilare: main.cpp: In member function 'void Btree::insert_not_full(Node*, int)': main.cpp:98:48: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 98 | if (node->children[i + 1]->keys.size() == (2 * this->t - 1)) /// if the selected child is full we split it | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Btree::deleteKey(Node*, int)': main.cpp:170:45: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 170 | else if (node->children[i]->keys.size() >= t) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ main.cpp:177:52: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 177 | if (node->children[i - 1]->keys.size() >= t) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ main.cpp:179:57: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 179 | else if (node->children[i + 1]->keys.size() >= t) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ main.cpp:186:52: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 186 | if (node->children[i + 1]->keys.size() >= t) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ main.cpp:192:52: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 192 | if (node->children[i - 1]->keys.size() >= t) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ main.cpp:191:17: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else] 191 | else if (i + 1 == node->children.size()) | ^ main.cpp: In member function 'void Btree::delete_internal_node(Node*, int, int)': main.cpp:207:40: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 207 | if (node->children[i]->keys.size() >= t) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ main.cpp:212:49: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 212 | else if (node->children[i + 1]->keys.size() >= t) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ main.cpp: In member function 'int Btree::delete_predecessor(Node*)': main.cpp:232:40: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 232 | if (node->children[n]->keys.size() >= t) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ main.cpp:236:23: warning: control reaches end of non-void function [-Wreturn-type] 236 | delete_predecessor(node->children[n]); | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Btree::delete_successor(Node*)': main.cpp:250:21: warning: control reaches end of non-void function [-Wreturn-type] 250 | delete_successor(node->children[0]); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Btree::biggestKeyBelowLimit(int, Node*)': main.cpp:347:37: warning: control reaches end of non-void function [-Wreturn-type] 347 | biggestKeyBelowLimit(x, node->children[i]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'int Btree::smallestKeyOverLimit(int, Node*&, int&, Node*)': main.cpp:382:37: warning: control reaches end of non-void function [-Wreturn-type] 382 | smallestKeyOverLimit(x,end,pos, node->children[i]); | ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Btree::delete_merge(Node*, int, int)':