Write a program that creates minimum 10 notes in a binary tree: Solution

Write a program that creates minimum 10 notes in a binary tree: Solution

Write a program that creates minimum 10 notes in a binary tree, where the root has the value x=60, and the left child node has a value of x-2 : while the right child has a value x+4. Recursively, create all nodes and fill-in their values. Execute your code and show the output. Note: Submit on papers a graphical representation of the tree.

Q2: write a method to check whether the binary tree in Q1 is mostly balanced. Execute your code and show the output.
Powered by