3. The following is a recursive algorithm for a preorder binary tree traversal. Determine the worst-case runtime of this algorithm where the proper binary tree t has n internal nodes (non null nodes). Do this by specify the recurrence equation for the runtime T(n) and then deriving the closed form. Count the comparison v != null as 1 primary operation and the call processNode(t,v) as c primary operations, where c is some constant. Algorithm preorder(Tree t, TreeNode v) Input: Binary tree t of size n and node v of t Output: None if v!= null then end end processNode(t.v) preorder(t,v.getLeft()) preorder(t,v.getRight())

3.2.5 Assume we are given the option to insert the search keys in any order we like and that we are aware of how frequently a BST will need to access them.Should the keys be added to the tree in a different order, or in order of decreasing likelihood of access? Describe your response. 3.2.6 Add the tree's height-calculating method height() to BST. Create two implementations: a recursive method that adds a field to each node in the tree and takes linear space and constant time every query, and a method similar to size() that takes linear space and constant time per query. 3.2.5 Assume we are given the option to insert the search keys in any order we like and that we are aware of how frequently a BST will need to access them.Should the keys be added to the tree in a different order, or in order of decreasing likelihood of access? Describe your response. 3.2.6 Add the tree's height-calculating method height() to BST. Create two implementations: a recursive method that adds a field to each…

Given two (singly) linked lists, determine if the two lists intersect. Return the intersecting node. Note that the intersection is defined based on reference, not value. That is, if the kthnode of the first linked list is the exact same node (by reference) as the jth node of the secondlinked list, then they are intersecting.