Write an equals method for the BinaryTree class. This function should return true if and only if the trees are similarly shaped and refer to equal values (every Object, including the Objects of the tree, has an equals method

Write code to traverse a binary tree in preorder and postorder.  You may use my tree code as a starting point.  The tree should contain at least eight nodes.  You may hardcode the initialization into your program like I showed in class.  Set up your tree in the program by calling setTree(---) like I did in my code. After calling your two traversals, call my inorderTraverse() method to verify that your methods print (effectively!) the same tree.  I changed the inOrderTraverse () method to be private, as I mentioned in class. Note:  When demonstrating the program, first turn in a hand-drawn picture of your tree. Data fields are:Title of book

Please help with C++ question in image. Thank you.

True or False: The largest element in any non-empty BST always has no right child. True or False: The smallest element in any non-empty BST always has no right child. A tree node that has no children is called a node. The children of a same parent node are called as

In java: binary tree Write a method called findTotalParents (, this method will find all the nodes that considered to be parents with any dependency and return the total number of parents. The public method shall not take any parameters, but the private method takes a BNode as a parameter, representing the current root.