void insertBST(BST &T, int newKey){ Node *q = nullptr; Node *p = &T.root; while (p != nullptr){ int i = 0; if (newKey == p->ke