# Introduction In this challenge, we will be implementing a function called `rightSideView` that takes the root of a binary tree as input and returns the values of the nodes that can be seen from the right side of the tree, ordered from top to bottom. We will need to write the implementation code for this function. The challenge also provides example inputs and outputs to help us understand the expected behavior of the function.
Click the virtual machine below to start practicing