Tasks: Do two steps for the following questions.

• Part 1: describe solution algorithms in English sentences.
• Part 2: provide a pseudo code of the algorithm described in part 1. Actual coding is not required for the submission.

Question 1:

Implement a function to check if a binary tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that the heights of the two subtrees of any node never differ by more than one.

Hint: know how to calculate the height of a node first

Algorithm:

Pseudo Code:

.

Question 2:

Given a sorted (increasing order) array with unique integer elements, write an algorithm to create a binary search tree with minimal height.

Hint: height is the longest path of a tree.

Algorithm:

Pseudo Code: