Question 5: Binary tree right-side view Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example: input: root =(5) output: [5,15,35,45] Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum. Example: input: root =(5), targetSum =22 output: true