When I have to show that some space $A$ IS NOT separable, does it always work if I find uncountable subset $B\subset A$, $|B|=2^{\aleph_0}$ and set C of disjoint open balls, $C=\{L(x,r): x\in B\}$.
If $A$ IS separable, then $\exists D\subset A$ such that $|D|\leq \aleph_0$ and $(\forall x\in A)(\forall r >0)(\exists y\in D) y\in L(x,r)$.
So, if I want A to be separable, then $D$ has to have non-empty intersection with all elements from $C$, so it would be $|D|=|C|=|B|=2^{\aleph_0}$, which means that D does not satisfy condition $|D|\leq \aleph_0$ and $A$ is not separable.
Yes, you are absolutely right. Any dense set must intersect every nonempty open set. So if you can find uncountably many nonempty open sets that are pairwise disjoint, then any dense set must be uncountable, and the space cannot be separable.