Let $F$ be a graph, and let $\mathcal{B}_r(F)$ be the class of $r$-uniform Berge-$F$ hypergraphs. In this paper, we establish a relationship between the spectral radius of the adjacency tensor of a uniform hypergraph and its local structure through walks. Based on the relationship, we give a spectral asymptotic bound for $\mathcal{B}_{r}(C_3)$-free linear $r$-uniform hypergraphs and upper bounds for the spectral radii of $\mathcal{B}_{r}(K_{2,t})$-free or $\{\mathcal{B}_{r}(K_{s,t}),\mathcal{B}_{r}(C_{3})\}$-free linear $r$-uniform hypergraphs, where $C_{3}$ and $K_{s,t}$ are respectively the triangle and the complete bipartite graph with one part having $s$ vertices and the other part having $t$ vertices. Our work implies an upper bound for the number of edges of $\{\mathcal{B}_{r}(K_{s,t}),\mathcal{B}_{r}(C_{3})\}$-free linear $r$-uniform hypergraphs and extends some of the existing research on (spectral) extremal problems of hypergraphs.