A tree where each node can have at most 3 children (Left, middle and right). Each node contains an integer.

Also:

1. The root value is higher than all values of its left subtree

2. The root value equals all values of its middle subtree

3. The root value is lower than all values of its right subtree

Questions:

(a)

(b) Write a method search (treenode t, int value), that returns the number of times the integer input parameter value is in such a tree t.

=============

Java problems.

a) Please check the shape for each tree below to see if they fulfill these requirements: Left tree (yeso): Right tree (yeso)