Here are three different solution methods for calculating the probability that a given player gets a streak of at least 10 baskets in a given game. I believe method C is the most straightforward and least error prone, so long as you can numerically evaluate matrix powers, which can readily be done in many computing environments. I will not discuss paragraphs 2. and 3. of the OP's question, since they are addressed in MikeP's answer. The bottom line is that there's a pretty damn good chance that there will be at least one streak of at least 10 baskets by at least one player during the 82 game long season (but this probability is less than one).
Method A: Condition on the number of baskets made, and use the law of total probability to find the probability of a streak of at least 10 baskets. This is the @MikeP method more or less.
$$P(\text{streak of at least 10}) = \sum_{k=10}^{15} P(\text{streak of at least 10|exactly k baskets made}) P(\text{exactly k baskets made})$$ First note that Probability of making exactly k baskets (not necessarily in a row) = ${15 \choose k} 0.5^{15}$. If the player makes exactly 10 baskets, then MikeP's fraction of ways of making 10 baskets which result in a streak of 10 baskets, times probability of making exactly 10 baskets, has a ${{15}\choose{10}}$ in the numerator and denominator which cancel out, resulting in a total of 6 ways, each having probability $0.5^{15}$ of occurring, for a total contribution to the above sum of $6 *.5^{15}$ But that is the easy term. For 11 baskets made, a streak of at least 10 can start on shot 1,2,3,4, or 5, and for each of these, there are ${5\choose 1}$ possibilities for where the other basket goes. For 12 baskets, a streak of at least 10 can start on shots 1,2,3, or 4, and for each of these, there are ${5 \choose 2}$ possibilities for where the other 2 baskets go, etc. So the number of possibilities, each with a probability of $0.5^{15}$ to get a streak of at least 10 =
$$6 {5\choose0} + 5 {5\choose1} + 4 {5\choose2} + 3 {5\choose 3} + 4 {5\choose 4} + 5 {5\choose 5} = 112.$$ So $P(\text{streak of at least 10}) = 112 * .5^{15}$.
Method B: Condition on the shot at which streak of at least 10 starts.
Then use the law of total probability to get the answer.
If the streak of at least 10 starts on shot 1, then anything goes on shots 11 through 15, for a total of $2^5 = 32$ possibilities, each having probability of occurrence of $.5^{15}.$
If the streak of at least 10 starts on shot 2, then shot 1 must have been a miss, but anything goes on shots 12 through 15, for a total of $2^4 = 16 $ possibilities, each having probability of occurrence of $.5^{15}.$
If the streak of at least 10 starts on shot 3, then shot 2 must have been a miss, but anything goes on shots 1 and 13 through 15, for a total of $2^4 = 16 $ possibilities, each having probability of occurrence of $.5^{15}.$
If the streak of at least 10 starts on shot 4, shot 3 must have been a miss, but anything goes for shots 1,2,14, and 15, for a total of $2^4 = 16$ possibilities, each having probability of occurrence of $.5^{15}$.
If the streak of at least 10 starts on shot 5, shot 4 must have been a miss, but anything goes for shots 1,2,3, and 15, for a total of $2^4 = 16$ possibilities, each having probability of occurrence of $.5^{15}$.
If the streak of at least 10 starts on shot 6, shot 5 must have been a miss, but anything goes for shots 1 through 4, for a total of $2^4 = 16$ possibilities, each having probability of occurrence of $.5^{15}$.
Adding these up, there are (32 + 5 * 16) = 112 possibilities, each having probability of occurrence of $.5^{15}$. So we have duplicated the result from method A.
Method C: Use Discrete Time Markov Chain. Note: This is much simpler in my opinion than the counting required in methods A and B, and all the more so for other problem variants (data input changes, such as probability of making a basket, length of streak, and number of shots)) for which the logic needs to be reworked, and may become more complicated, in order to correctly use those methods, but the Markov Chain approach is changed only in very straightforward ways.
Define a time-homogeneous Markov Chain with states 0, 1, ..., 10, where the state number is the current length of streak. Except that state 10 is special in that it is made an absorbing state, so that once the Markov Chain gets into state 10, it stays there. So state 10 really denotes that a streak of length at least 10 has occurred, even if that streak is not still in progress.
Each shot counts as one step of the Markov Chain. The Markov Chain is started in state 0 after 0 shots, and there are 15 steps until the end of the game. So letting $P_{\text{one step}}$ be the one step transition matrix of the Markov Chain, the probability of interest (a given player having streak of at least 10 in a given game) is equal to the state 0 (row) to state 10 (column) element of $P_{\text{one step}}^{15}$.
Here is $P_{\text{one step}}$, with states ordered from 0 to 10. For each state i, other than 10, there is a 0.5 probability of transitioning to state i+1 (occurs if make the basket), and 0.5 probability of transitioning to state 0 (occurs if miss). State 10 only transitions to state 10 by construction as an absorbing state (once a streak of at least 10 has occurred, that streak can not be taken away for the rest of the game).
0.5000 0.5000 0 0 0 0 0 0 0 0 0
0.5000 0 0.5000 0 0 0 0 0 0 0 0
0.5000 0 0 0.5000 0 0 0 0 0 0 0
0.5000 0 0 0 0.5000 0 0 0 0 0 0
0.5000 0 0 0 0 0.5000 0 0 0 0 0
0.5000 0 0 0 0 0 0.5000 0 0 0 0
0.5000 0 0 0 0 0 0 0.5000 0 0 0
0.5000 0 0 0 0 0 0 0 0.5000 0 0
0.5000 0 0 0 0 0 0 0 0 0.5000 0
0.5000 0 0 0 0 0 0 0 0 0 0.5000
0 0 0 0 0 0 0 0 0 0 1.0000
Perform the calculation described above, and voila, the answer matches methods A and B.