JAVA

Homework 8: Trees & Heap

Question 1:

Given an integer array nums and integer k, return the k(th) smallest element from that array.

Example: input: nums=[2, 6, 23, 1, 7, 11, 9, 12], k=3

output: 6

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 3: Path Sum

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

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]

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]