Implement the binary tree ADT using a linked structure as we developed in class, add the following methods: - def countK(self, num): function that takes in num and counts number of times num appears in the binary tree - def equal(self, other: BinaryTree): function thats takes in another binary tree (other) as parameter and returns true if both binary trees are equal, otherwise function returns False.

Write Java code to:  find the lowest common ancestor of two nodes n1, n2 in a linked binary tree structure. The lowest common ancestor is the lowest node in the tree thathas both n1 and n2 as descendants.

The following code implementation for an inorder traversal has a "visit" function as a parameter. I do not know how it works and what ways it plays a role in the traversal of the linked list in a binary tree.

class IntBTNode {             private int data;             private IntBTNode left;             private IntBTNode right; } Write a new static method of the IntBTNode class to meet the following specification. Make the method as efficient as possible (do not visit nodes unnecessarily).   public static int max(BTNode root)      // Precondition: root is the root reference of a nonempty binary SEARCH     // tree.    // Postcondition: The return value is the largest value in the tree.

In Java,  Complete the incomplete method of ExpressionTree.java. The incomplete methods are private Node parsePrefix(Scanner input) // Required public void parseInfix(String string) // Optional public void parsePostfix(String string) // Optional Implementations of parseInfix and parsePostfix require use of a stack. Implementation of parsePrefix does not. Read all of the ExpressionTree.java file before starting your implementation, so that you see the helper methods that are provided and get an idea of the context for your implementation.  Although not needed for your implementation, you should be sure you understand how the toStringPrefix, toStringInfix, and toStringPostfix methods work. Note: The main() method accepts a single String as its argument. The String should be a prefix, infix, or postfix mathematical expression with no characters other than operators (+, -, *, and /) and operands (single characters a-z).  As written, the main() method calls parsePrefix() to create an…

Java / Trees: *Please refer to attached image* What is the inorder of this tree? Multiple chocie. G X C A N V F Q L W G X C A N V F L W E A C V N X G F L W E A C V N VG F L W E

Don't skip

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.

C++