Declaring Haskell Types

Write a function that will return the maximum element of a Binary Search Tree, given the pointer to the root of the tree. Use the following function prototype: int getMaxOfBST(Node* root);

Computer Science Exercise: depth [★★] Write a function depth : 'a tree -> int that returns the number of nodes in any longest path from the root to a leaf. For example, the depth of an empty tree (simply Leaf) is 0, and the depth of tree t above is 3. Hint: there is a library function max : 'a -> 'a -> 'a that returns the maximum of any two values of the same type. please use Ocaml for the coding

Computer Science Exercise: shape [★★★] Write a function same_shape : 'a tree -> 'b tree -> bool that determines whether two trees have the same shape, regardless of whether the values they carry at each node are the same. Hint: use a pattern match with three branches, where the expression being matched is a pair of trees. please use Ocaml for the coding

Given a binary tree, write a function that prints the binary search tree’s nodes level by level, for example the following tree will have the following output statement:1, 2, 3, 4, 5

Code in C++ only In a rooted tree, the lowest common ancestor (or LCA for short) of two vertices u and v is defined as the lowest vertex that is ancestor of both that two vertices. Given a tree of N vertices, you need to answer the question of the form "r u v" which means if the root of the tree is at r then what is LCA of u and v. Input: 4 12 23 14 2 142 242 Output: 1

In Python

In C++ Question A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0.       Example: head refers to the list of nodes 1 → 2 → 3 → 1 → NULL. There is a cycle where node 3 points back to node 1, so return 1.   Function Description: Complete the has cycle function provided in the moodle assignment folder. It has the following parameter: • SinglyLinkedListNode pointer head: a reference to the head of the list.       Returns: • int: 1 if there is a cycle or 0 if there is not.   Note: if the list is empty, head will be null.   Input Format: The code stub reads from stdin and passes the appropriate argument to your function. The custom test cases format will not be described for this question due to its complexity. Expand the section for the main function and review the code if you would like to figure out how to create…

Write a function f1 that takes the root of a binary tree as a parameter and returns thesum of the nodes, which are the right child of another node. The root of the tree is not achild of any node.

A BST is constructed in the usual way using the node definition below. Write a function int child2( bst node t *curr) that returns the number of nodes that have 2 children. typedef struct BST NODE T {int data;struct BST NODE T *left, *right; } bst node t;   int child2( bst node t *curr){     }

Write a function same_shape : 'a tree -> 'b tree -> bool that determines whether two trees have the same shape, regardless of whether the values they carry at each node are the same. Hint: use a pattern match with three branches, where the expression being matched is a pair of trees.

Code you provide code in python?

quick Solution please

rewite usung for loop

Use the screenshot below to code a Depth-first search (DFS) algorithm in C++. Please explain what each line of code does.

The seventh digit of my id is 6.

Implement the following JavaScript function (SEE ATTACHED PHOTO FOR THE PROBLEM)

Code in Python:

python: In a binary search tree, write another way of function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p):     root=p     def helper(root, l, r):         if not root:             return True         if not (left<root.val and root.val<right):             return False         return helper(root.l, l, root.val) and helper(root.r, root.val, r)       return helper(root, float('-inf'), float('inf'))

Language: C++ Solve the following problem using a Singly Linked List.Given a singly linked list of characters, write a function to make a word out of given letters in the list Example:Input:C->S->A->R->B->B->E->LNULLOutput:S->C->R->A->B->B->L->E->NULL

In C++ write a program that prints the first cycle in a directed graph from any given node. The graph is stored in and adajency list in the form "vector adj[]"

Programming questions：typedef struct node {      int data;      struct node  *left, *right;}BT;The node structure of the binary tree (BT) is shown above. There is a binary tree T, please complete the function: int degreeone(BT *T) to compute how many degree 1 node in the BT. The T is the root pointer, and the function shoule return the total number of degree 1 node.

Cod

python Define a function sorted_intersection which • accepts two sequences, and • return a list whose elements are in ascending order and from the intersection of the given lists. For example: Test assert sorted_intersection ([1,2,3], [2,3,4]) [2,3] assert sorted_intersection ([1,3,5,7,9], [1,9,5]) == [1,5,9] Result