Use Java and Answer Both questions please.

Homework 8: Trees & Heap

Question 2:

Given the roots of two binary trees p and q, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical, and the nodes have the same

value.

Question 4:

Given an integer array nums and an integer k, return the k most frequent elements. You may return the

answer in any order.

Example: Input: nums = [1,1,1,2,2,3], k = 2

Output: [1,2]