Compilare: main.cpp: In instantiation of 'bool ScapegoatTree<T>::is_height_balanced(size_t) [with T = int; size_t = long unsigned int]': main.cpp:845:14: required from 'typename ScapegoatTree<T>::iterator ScapegoatTree<T>::insert(const T&) [with T = int; typename ScapegoatTree<T>::iterator = BinarySearchTree<int>::Iterator]' main.cpp:993:28: required from here main.cpp:966:19: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare] 966 | return height <= result; | ~~~~~~~^~~~~~~~~ main.cpp: In instantiation of 'BinarySearchTree<T>::Iterator::Iterator(BinarySearchTree<T>::Node&) [with T = int]': main.cpp:845:49: required from 'typename ScapegoatTree<T>::iterator ScapegoatTree<T>::insert(const T&) [with T = int; typename ScapegoatTree<T>::iterator = BinarySearchTree<int>::Iterator]' main.cpp:993:28: required from here main.cpp:71:21: warning: 'BinarySearchTree<int>::Iterator::ptr' will be initialized after [-Wreorder] 71 | PointerType ptr; | ^~~ main.cpp:70:15: warning: 'BinarySearchTree<int>::Node* BinarySearchTree<int>::Iterator::node' [-Wreorder] 70 | Node *node; | ^~~~ main.cpp:492:1: warning: when initialized here [-Wreorder] 492 | BinarySearchTree<T>::Iterator::Iterator(BinarySearchTree<T>::Node &node) : ptr(&node.value), node(&node) {} | ^~~~~~~~~~~~~~~~~~~ main.cpp: In instantiation of 'BinarySearchTree<T>::Node::Node(size_t, const T&, BinarySearchTree<T>*, size_t, size_t, size_t) [with T = int; size_t = long unsigned int]': /usr/include/c++/12.2.1/bits/stl_construct.h:97:14: required from 'constexpr decltype (::new(void*(0)) _Tp) std::construct_at(_Tp*, _Args&& ...) [with _Tp = BinarySearchTree<int>::Node; _Args = {long unsigned int&, const int&, BinarySearchTree<int>*, long unsigned int&, long unsigned int&, long unsigned int&}; decltype (::new(void*(0)) _Tp) = BinarySearchTree<int>::Node*]' /usr/include/c++/12.2.1/bits/alloc_traits.h:518:21: required from 'static constexpr void std::allocator_traits<std::allocator<_Up> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = BinarySearchTree<int>::Node; _Args = {long unsigned int&, const int&, BinarySearchTree<int>*, long unsigned int&, long unsigned int&, long unsigned int&}; _Tp = BinarySearchTree<int>::Node; allocator_type = std::allocator<BinarySearchTree<int>::Node>]' /usr/include/c++/12.2.1/bits/vector.tcc:117:30: required from 'constexpr std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {long unsigned int&, const int&, BinarySearchTree<int>*, long unsigned int&, long unsigned int&, long unsigned int&}; _Tp = BinarySearchTree<int>::Node; _Alloc = std::allocator<BinarySearchTree<int>::Node>; reference = BinarySearchTree<int>::Node&]' main.cpp:488:38: required from 'void BinarySearchTree<T>::emplace(const T&, size_t, size_t, size_t) [with T = int; size_t = long unsigned int]' main.cpp:840:22: required from 'typename ScapegoatTree<T>::iterator ScapegoatTree<T>::insert(const T&) [with T = int; typename ScapegoatTree<T>::iterator = BinarySearchTree<int>::Iterator]' main.cpp:993:28: required from here main.cpp:119:11: warning: 'BinarySearchTree<int>::Node::value' will be initialized after [-Wreorder] 119 | T value; | ^~~~~ main.cpp:116:16: warning: 'size_t BinarySearchTree<int>::Node::left_index' [-Wreorder] 116 | size_t left_index; | ^~~~~~~~~~ main.cpp:326:1: warning: when initialized here [-Wreorder] 326 | BinarySearchTree<T>::Node::Node( | ^~~~~~~~~~~~~~~~~~~ main.cpp:117:16: warning: 'BinarySearchTree<int>::Node::right_index' will be initialized after [-Wreorder] 117 | size_t right_index; | ^~~~~~~~~~~ main.cpp:114:27: warning: 'BinarySearchTree<int>* BinarySearchTree<int>::Node::p_bst' [-Wreorder] 114 | BinarySearchTree *p_bst; | ^~~~~ main.cpp:326:1: warning: when initialized here [-Wreorder] 326 | BinarySearchTree<T>::Node::Node( | ^~~~~~~~~~~~~~~~~~~