We studied binomial edge ideals, which are at the intersection of graph theory and abstract algebra. Our focus was the multidegrees of these ideals, which contain valuable geometric information. We proved algebraic results that allowed us to write a closed formula for the multidegree of the binomial edge ideal of a graph based on combinatorial properties of the graph. Then we discovered methods to make the process more efficient. We concluded our research by using our results to find the multidegrees of the binomial edge ideals of many families of graphs.