Use C++ to: implement binary search tree to store integer number insert, delete print all elements ( LRV, LVR, VLR)

Python: Describe a recursive algorithm that counts the number of nodes in a singly linked list.

Need help with standard ML languege I need to write a binarySearch function that recursively implements the binary search algorithm to search a sorted integer list for a specified integer and returns true if it is found, false otherwise. For example, binarySearch ([100,200,300,400,500], 200) returns true, whereas binarySearch([100,200,300,400,500], 299) returns false. Hint: Write a helper function mid that returns a tuple (index, value) representing the middle value in a list. For example, mid [10, 2, 40, 8, 22] returns (2,40) because the value 40 at index 2 is the middle value in the list. Similarly, mid [10, 20] would return (1, 20). Use mid in conjunction with slice to implement binarySearch.

Recursive Multiplication Given an JavaScript object list of books that each have a pages attribute to define the number of pages in the book, find the product of all the pages in the object list of books using recursion (you must use recursion to solve this problem). Keep in mind: The input list object may be completely empty (ex. {}) The next attribute may not be defined function getPageCount(list) {// your code here// returns an integer}Example test case:Input: {"book":"A","pages":1,"next":{"book":"B","pages":2,"next":{"book":"C","pages":3,"next": null}}}Output: 6Reasoning: 1 * 2 * 3 pages

53: What sorting algorithm is this? void Sort1(string arr[], int beg, int end) { int piv index = subdivision(arr, beg, end); if (piv_index-1> beg) { Sort1(arr, beg, piv_index-1); } if (piv_ind+1 piv) down--; if (up <= down) { tmp = arr[up]; arr[up] = arr[down]; arr[down] = tmp; up++; down --; } arr[beg] = arr[down]; arr[down] = piv; return down; %3D

def reverse_list (1st: List [Any], start: int, end: int) -> None: """Reverse the order of the items in list , between the indexes and (including the item at the index). If start or end are out of the list bounds, then raise an IndexError. The function must be implemented **recursively**.>>> lst ['2', '2', 'v', 'e']>>>reverse_list (lst, 0, 3)>>> lst ['e', 'v', 'i', '2']>>> lst []>>>reverse_list (lst, 0, 0)>>> lst [0]>>> Ist = []>>> reverse_list (lst, 0, 1) Traceback (most recent call last): IndexError #1 #1

Write a C++ code to insert the following numbers in two Binary Search Trees. Insert numbers of first list in Binary Search Tree#1, and numbers of second list in Binary Search Tree#2. Do not insert both lists in a single Binary Search Tree. List#1. 5, 78, 45, 23, 11, 89, 10, 78, 6, 99, 876, 5, 67, 13 List#2. 5, 89, 688, 52, 557, 953, 5, 7, 55, 35, 89, 99, 99, 6, 557, 89, 5, 99, 6, 2, 45, 12, 7, 6, 94, 93, 99, 67 After inserting numbers in Binary Search Trees. Write a function to print only those numbers that appear in List#1 and more than 2 times in List#2. For example, the number "5" appears in List#1 and 3 times in List#2. So your code should print "5" and similar other numbers.

Perform the following operations utilizing c++ code.N.b array size to be used is ten.a)enqueue() i.e enqueue the list; Two,three,four,five,six,seven and eight and after display enqued list.b)dequeue() i.e delete or remove any two elements in the queue in a) above and after display the updated queue after deletion.c)ISfull() i.e Display if the queue is Full or not.d)Isempty() i.e Display if the queue is Empty or not.e)print() i.e print the final list of the elements of the Queue after performing tasks of a) - d).

C++ please Please complete Programming Exercise 4, from pages 1402, from chapter 19 from your textbook. Write a function, singleParent, that returns the number of nodes in abinary tree that have only one child. Add this function to the classbinaryTreeType and create a program to test this function. (Note: Firstcreate a binary search tree.)

7. display a value at a specified index in a linked chain of integers For example, display the 3rd element in the chain, display the 10th element in the chain, etc. a.O(log n) b.O(n2) c.O(n) d.O(1) e.none of these is correct

C programming help get numbers from user using a struct that points(pointer) into a binary search tree and another pointer into a array to use merge sort on the array then prints out all the numbers and at what hight they are in the binary tree and also prints out the sorted array

Python code Screenshot and code is must

How should I insert nodes into a data structure so that insertion, deletion, and searching take less than O(n) time?