Branching patterns are ubiquitous in nature; consequently, over the years many researchers have tried to characterize the complexity of their structures. Due to their hierarchical nature and resemblance to fractal trees, they are often thought to have fractal properties; however, their non-homogeneity (i.e., lack of strict self-similarity) is often ignored. In this paper we review and examine the use of the box-counting and sandbox methods to estimate the fractal dimensions of branching structures. We highlight the fact that these methods rely on an assumption of self-similarity that is not present in branching structures due to their non-homogeneous nature. Looking at the local slopes of the log–log plots used by these methods reveals the problems caused by the non-homogeneity. Finally, we examine the role of the canopies (endpoints or limit points) of branching structures in the estimation of their fractal dimensions.