Binary Tree Paths

# Introduction

In this challenge, we will be implementing a function called `binaryTreePaths` that takes the root of a binary tree as input and returns all the root-to-leaf paths in any order. We are given two examples with their expected outputs to illustrate the desired behavior of the function.