MemoManager class has a BinaryTree object named $$bTreeDate$$ which stores Nodes. All nodes are

arranged by the memo$$s date $($node$.$key is Date type$).$

Helps on reverseOrder$()$ method

If you do not know how this can be done, please

draw two binary trees with the same data

inputs.

When you draw the second tree, you put a node

with a bigger key value on the left and smaller

key value on the right.

Check the difference between these two trees. I

am happy to discuss it with you in the lab.

Wish it helps $$

MemoManager class has a BinaryTree object named $$bTreeTitle$$ which stores Nodes. All nodes are

arranged by the memo$$s title $($node$.$key is String type$).$

MemoManager class has a method named $$addMemo$$ which takes a String date, a String title, and

a String message to create a Memo object then calls addToTree$()$ twice and passes the Memo object

with different keys $($date and title$)$ to add on different trees.

MemoManager class has a method named $$addToTree$$ which takes a Memo object and a key $($the

type of key can be Date or String$)$ to add to the bTreeDate and bTreeTitle

MemoManager class has a method named $$findMemo$$ which takes a searching key and returns the

memo that matches the searching key by calling binaryTree. searchElement$($key$).$ If the memo does

not exist, it returns null.