Write an algorithm to find the sum of all the elements in a binary tree please use basic java coding.

PYTHON PROGRAMMING ONLY (BINARY SEARCH TREE) IF POSSIBLE USE PYCHARM AND INSTALL BINARYTREE  IN PYTHON PACKAGES.   Create a program that does the following:1. Generate a random binary tree with 12 elements. You can leave the perfect option asFalse.2. Print the tree.3. Test the tree properties. The documentation uses the assert statement.4. Create a binary search tree manually (not using the bst function, but instead buildingit by hand. Put at least 8 elements in it.5. Print this tree.6. Print the values in the tree in several orders (inorder, postorder, preorder, etc.)

Manually create a binary search tree from the following list 32 89 72 56 54 20 14 21 18

USING THE C LANGUAGE (CANNOT BE C++ OR JAVA): Write a menu-driven program that offers the following menu items:              Create an integer binary tree Display the tree in in the console. Remove a specific node in the tree Display the tree in in the console. Search an item in the tree and show the visiting trace path   For the binary tree creation, you can address this by an automatic process via random number generation. You may ask user input for the number of nodes in the tree.  For the search feature, the program will print out the visiting trace path of that search at the end of the operation. If the item is not found, a message saying “the item is not found” is printed to the console instead.  Example of displaying a binary search tree (use the right representation for your submission):     Original Tree (see picture)    Display in your Console(see picture) Your output file should include the following: The tree that you created The tree after removing a node Both cases for…