First, let me remark that every $\beta$-model can be identified with a transitive model of $\mathsf{ATR_0^{set}}$ (the detail is available in Simpson's book on the second-order arithmetic.)
Thus let me work with transitive models of a set theory instead.
The following argument shows your first statement negatively:
Claim. Suppose that $M$ is a transitive model of $\mathsf{ATR_0^{set}}$ and closed under the relative constructibility. If $a\in M$ is a real, then $\omega_1^{L[a]}\subseteq M$.
Proof. Suppose that $\xi<\omega_1^{L[a]}$, then we can find a well-order $X$ in $L[a]$ whose field is $\omega$ and isomorphic with $\xi$. Clearly $X\le_c a$, so the assumption implies $X\in M$. By the axiom Beta over $M$, $\xi\in M$.
On the other hand, the least $\beta$-model of $\Pi^1_1\text{-}\mathsf{CA}_0$ has the height $\omega_\omega^\mathsf{CK}$ (the limit of the first $n$ admissible ordinals), which is strictly below than $\omega_1^L$. Thus not every model of $\Pi^1_1\text{-}\mathsf{CA}_0$ is closed under relative constructibility. The answer is negative even in the case $T=\mathsf{Z}_2$ since there is a transitive model of $\mathsf{Z}_2$ of height less than $\omega_1^L$.
Also, your second question has a partial positive answer by the following argument:
Claim. Every $\omega$-model closed under the relative constructibility is a $\beta$-model.
Proof. Let $M$ be an $\omega$-model of $\mathsf{ATR_0^{set}}$ (that is, $\omega^M=\omega$.) We claim that $M$ reflects every true $\Sigma^1_1$-sentence.
Let $a\in M$ be a real, and $\exists x \phi(x,a)$ be a true $\Sigma^1_1$ sentence with parameter $a$ and an arithmetical formula $\phi$. By Shoenfield absoluteness, $L[a]$ also thinks $\exists x \phi(x,a)$ holds, so we can find $b\in L[a]$ such that $\phi(b,a)$. From $b\le_c a$ we get $b\in M$ and so $M\vDash \phi(b,a)$.