a. Write a function which will take a binary tree as input and return the total number of nodes in: the tree. Your code must count the nodes by traversing the tree. b. Write a function which will take a binary tree as input and return the number of total number ef leaves in the tree. Your code must count the leaves by traversing the tree. c. Write code fer building (insertion) a ternary tree. A node (Ternary tree class) in a ternary tree may have et most 3 children. You may need to modify the TrceNode class discussed ir. class and add functions to insert nodes. d. We discussed a methodology to delete a node which has 2 children from BST and in ormally argued aivout the correctness of this methodology.
Q: Please answer in Python 1) Write a function towards which takes as an argument a list li…
A: The solution to the given problem is below. ***Note: According to Bartleby policy we are not…
Q: rite a program Java to search for the key element from the give list and display its location using…
A: Below is the given code-
Q: 7 Write a complete C program to do the following: (i) Define a function Nodeptr CreateDLL(char…
A: The program is written in c
Q: Write a function min2 to compute the second smallest of number of an integer list. You may assume…
A: ANSWER: Second and Smallest of Number: A Simple Solution is to sort the exhibit in expanding…
Q: Write an ML function that inputs a 3-tuple of integers and returns a list of the integers in sorted…
A: Actually, python is a easiest programming language. It is a dynamically typed programming language.…
Q: Write a function flat_list() which takes a list that contains unknown number of lists. This function…
A: Since Python is weakly typed, you can encounter regular and irregular lists of lists. Every element…
Q: Use Standard ML Code: Write a function that returns the factorial of a number. Write a function…
A: The above question is solved in step 2:-
Q: Write a program in c++ that will be read the file input and display it in NLR as an AVL tree For an…
A: What are AVL Trees? AVL trees are binary search trees in which the difference between the height of…
Q: Qno 2: Suppose you want to delete the root node of tree and replace it with the right child of the…
A: Suppose you want to delete the root node of tree and replace it with the right child of the tree.…
Q: I'm looking over my code for my tree and I keep receiving segmentation faults when I try to add or…
A: The segmentation fault receives when memory location is not accessible to use because either it is…
Q: Write the following function: The function gets a root of a Binary Tree of ints, and a function f.…
A: Below i have given code:
Q: Write a generator function called dup() in Python that receives a sequence (.e,list,set, etc.) and…
A: According to the Question below the Solution: Output:
Q: The code of a sequential search function is shown on textbook page 60. In fact, if the list is…
A: """Program to seach target element in list""" #function to search target in listdef…
Q: Write a function truecount in SML of type bool ist -> int that takes a list of boolean values and…
A: We need to write a function truecount in SML of type bool ist -> int that takes a list of boolean…
Q: in c++, apply non-linear data structures to solve simple problems. Question - imagine having a List…
A: // Java program to segregate even and odd nodes in a// Linked Listclass LinkedList{ Node head; //…
Q: Write a function that returns square root if each element in list. Ex: [2,4,9,144]=========> [1.4142…
A: import mathdef GetSquareRoot(nums): #list will hold square root result=[] #iterate over…
Q: This code is for python Searching for Data In this lab we'll compare the time it takes to search for…
A: Instructions for solving the given problem:In part 1, use random.randint() function to generate…
Q: A a. A Pythagorean triple is a list [a, b, c] of positive integers a < b <c so that a + b? = c2.…
A: Python used to answer this question
Q: a function f1 that takes the root of a binary tree as a parameter and returns the sum of the nodes…
A: NOTE: - The working code is given in step implemented in c++ language. PROGRAM EXPLANATION: -…
Q: 4. Write a function, "outdegree", of two arguments, a node and the graph, which returns the…
A: Code: # Out degree for a vertex is the count# of direct paths from that vertex to other verticesdef…
Q: Given a number and a sorted binary tree, write function that inserts the number into the tree. Given…
A: The code for the above given question is given below:
Q: properties of sets, lists, vectors and strings are and whether they are mutable or immutable.
A: The given question is to discusses the data structures sets, lists, vectors and strings in the…
Q: use haskell haskell haskell haskell to write following : --> A function that is passed in a…
A:
Q: 3 Listdiff Use the built-in higher order functions² and write a non-recursive function val listdiff…
A: OCAML programming : a general purpose programming language with an importance on expressiveness. It…
Q: appens when we use the build-in function any() on a list? if any([True,False,False,False])==True:…
A: What happens when we use the build-in function any() on a list? if…
Q: Given a sorted array, write a program named as ProblemB.cpp that creates a Binary Search Tree.…
A: Algorithm: 1) Get the Middle of the array and make it root. 2) Recursively do same for left half and…
Q: Write a function flat_list() which takes a list that contains unknown number of lists. This function…
A: new_li.append(ele): append ele in new_li in last position previous: new_li = [1, 2, 3] after…
Q: SOB 22 – (Block 2) Write up what the properties of sets, lists, vectors and strings are and whether…
A: Set Lists Vector String It is an unordered collection of a list. It is an ordered collection of a…
Q: unt, that takes a root node (as a pointer) of a binary tree to its function parameter. nte a…
A: Since multiple questions are asked so first three parts will be answered. Please upload remaining…
Q: 14. Suppose we have an integer list that contains quiz scores in which a score can range from 0 thru…
A: Python used to answer this question
Q: Write a function palindromes that accepts a sentence as an argument. The function then returns a…
A: Answer :
Q: I have an assignment that requires me to read strings from a text file and insert them into a binary…
A: A C program for the given criteria is as…
Q: Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the…
A: The logic behind a function that takes the root of a binary tree as a parameter and returns the sum…
Q: Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the…
A: “f1 ()” function: The “f1 ()” function for given conditions: f1 (root r) { //check root…
Q: get tokens_from_equation(line): Takes one string as input that contains any combination of digits…
A: 1) Below is program to define a function get_token_from_equation and test with line inputs It…
Q: list is sorted in ascending order if it is empty or each item except the last one is less than or…
A: Please find the answer below :
Q: 2. Write a function max(L) which examines the argument list L, and returns the largest object of ty…
A: In the first question, we have to find the maximum float element of the list.In the second question,…
Q: 1. A list of numbers is said to be balanced if the sum of its first half is equal to the sum of its…
A: As per our company guidelines we are supposed to answer only one question per post and kindly…
Q: Count word dominators def count_word_dominators(words): If you already solved the earlier…
A: Actually, python is a easiest programming language. It is a dynamically typed programming language.
Q: Write a function that will accept a list of integers and return the sum of the contents of the…
A:
Q: text file (tree.txt), load the data into a binary search tree representation in Python Implement a…
A: Implement a method to calculate the height of the tree from the root (iterative or recursive)
Q: Write a single LISP function, called TREE-ORDER, which takes one argument TREE, and returns an…
A: In this program we have to write a LISP program to do a post-order representation of a tree Let…
Q: Write a function count_evens(nums) that takes a list of ints called nums and returns the number of…
A: NOTE - I have used python programing language to solve the question. Here I have defined the…
Q: 14. Suppose we have an integer list that contains quiz scores in which a score can range from 0 thru…
A: Required:
Q: Write a function val nextpascalrow : int list -> int list = that given a list of integers that…
A: Given: Write a function val nextpascalrow : int list -> int list = <fun> that given a list…
Q: Write a function flat_list() which takes a list that contains unknown number of lists. This function…
A: In the following python code , we need to perform the following operations : Define the python…
Q: Write a C++ code, which tes a a) Function which inserts a node in the Doubly Linked List. Use any…
A: Program in C++: #include <iostream> using namespace std; // Create a node of the doubly…
Q: Consider the following pseudocode: // Utility function to swap left and right public static void…
A: The above pseudocode is recursively reversing the left node to the right node by using the swap…
Q: Higher-order function foldr: (X Y --> Y) Y ListOfX --> Y Which of the below is true? (select two)…
A: Higher-order function foldr: (X Y --> Y) Y ListOfX --> Y Option A And Option C is TRUE.
Q: Write a function f1 that takes the root of a binary tree as a parameter and returns the sum of the…
A: For writing the function with given description follow below points: Include header file iostream.…
Step by step
Solved in 2 steps with 3 images
- Q4. Write a program that read 2 matrices and has a function which finds their sum. Q5. Write a program that read 2 matrices and has a function which finds their multiplication. Q6. Write a program that handles a list of numbers where it has the following functions - Function that finds their average and sum - Function that finds their maximum and minimum - Function that search for a given number in that list. - Function that count the occurrence of a given number in that list. Then the program should do the following: - Read the list - Find the average and the sum of that list - Find the minimum and the maximum of that list - Count the occurrence of a given number in that list.CodeW X bFor fun X C Solved x b Answer + x https://codeworko... CodeWorkout X265: Recursion Programmlng Exercise: GCD The greatest common divisor (GCD) for a pair of numbers is the largest positive integer that divides both numbers without remainder. For function GCD , write the missing base case condition and action. This function will compute the greatest common divisor of x and y.You can assume that x and y are both positive integers and that x > y. Greatest common divisor is computed as follows: = x and GCD(x, y) = GCD(y, x % y). Examples: GCD (6, 4) -> 2 Your An swer: 1 public int GCD(int x, int y) { if > { 2. > 3. } else { 4. return GCD(y, x % y); 9. { 7. 1:09 AM 50°F Clear 1V 1. 12/4/2021 甲Use c++ 1. A Red-Black tree is said to be beautiful if all nodes in the alternate levels of the tree are of the same color. Write a program to check whether a Red-Black tree created from the given input is beautiful or not. Your program should include the following functions. • INSERTREDBLACK (struct node* root, key): Inserts a new node with the 'key' into the tree. • CHECKBEAUTIFUL (struct node* root): Checks whether the given tree is beautiful or not. Input format: Output format: • The output will be 1 if the Red-Black tree is beautiful else -1. Sample Input 1: 9 12 • The first line of input will be an integer 'n' which is the number of nodes in the tree. • After which 'n' integer inputs will be given subsequently which will be the keys of nodes of the tree. The keys are unique and values are in the range [1,1000]. 8 25 3 5 27 22 32 9 Sample Output 1: 1
- REVERSED SUM OF ODD POSITIONS Write a function that takes an integer(n) as input and returns True if the sum of its digits at odd positions is even, and returns False of otherwise. Positions are counted from the least significant digit. stion For example: n = 2345 →> True Explanation: The digits at odd positions are 5 and 3, and their sum i.e. 8 is even. Examples: rev_sum of odd_pos(2345) - True - False rev_sum_of_odd_pos(5728) *Note: Please return your output. Don't print your answer inside the function. Your code will not get evaluated, if you are using 'print statement inside the function." Answer: (penalty regime: 0 %) Reset answer 1-def rev_sun of odd pos (n: int)-> bool: 2 merite your code from here ePart (a) Write a python function that computes the binomial coefficient ("). The function should return the correct answer for any positive integer n and k where k=m pass Part (c) Suppose that the number of people in the trial is 100. Then: • Plot a curve that shows how the probability of type 1 error changes with the choice of m, for m = 1,...n assuming that the null hypothesis holds (in red), • On the same picture, plot the probability of type 2 error vs the value of m in the case in which the new drug is effective with proability 0.68 (in blue). You can plot the two curves using matplotlib.pyplot. You can select the color by passing color='r' or color='b' to the plt.plot() function. [4]: n - 100 # your code here def plot_curve (): pass [5]: plot_curve() Part (d) Based on the picture above, what value of m do you think would be suitable to keep both type 1 and type 2 error small at the same time? (You may assume that the company claims the new drug has 68% accuracy) [6]: # your…1.) Design a Binary Search Tree ADT by using following functions. Include the function definitions & run the program (Kindly include header files as well). Paste the output as a screenshot and write the code in your answer sheet. insert(int val)find(int x)************************************************************************************ class btNode { public: int info; btNode *lLink; btNode *rLink; btNode(int e, btNode *l = NULL, btNode *r = NULL) { info = e; lLink = l; rLink = r; } btNode() { lLink = NULL; rLink = NULL; } }; class binarySTADT { private: btNode *root; int count = 0; public: binarySTADT() { root = NULL; } void insert(int val); // function to insert a given value in the tree.…
- Assume this method is given within the KWLinkedList class, which answer is be correct public void Unknown() { if (size cur = head; Node prev = tail; for(int i=0; i< size/2; i++) { tail.prev.data = cur.data; cur= cur.next; } }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] ] has_perfect You are to write a function has "perfect (graph)" that takes in a BIPARTITE graph as its input, and then determintes whether or not the graph has a perfect matching. In other words, it will return the Boolean value True if it has one, and False if it does not. After compiling the above cell, you should be able to compile the following cell and obtain the desired outputs. print (has perfect({"A" : ["B", "C"], "B" : ["A", "D"], "C" : ["A", "D"], "D" : ["B", "C"]}), has perfect ( {"A" : ["B"], "B" : ["A", "D", "E"], "C" : ["E"], "D":["B"], "E": ["B","C","F"], "F":["E"]})) This should return True False Python Python
- [] [] partite_sets In the cell below, you are to write a function "partite_sets (graph)" that takes in a BIPARTITE graph as its input, and then returns a single list whose two entries are the partite sets of the graph as lists (the order of the sets outputed does not matter). After compiling the above cell, you should be able to compile the following cell and obtain the desired outputs. print (partite_sets({"A" : ["B", "C"], "B" : partite_sets({"A" : ["B", "C"], "B" : ["A"], "C" : ["A"]}), ["A", "D"], "C" : ["A", "D"], "D" : ["B", "C"]})) This should return [["B","C"], ["A"]] [["A","D"], ["B","C"]] (the order in which the entries appear does not matter) Python PythonWrite python code 1) Write a function verifsort that accepts a list as a parameter, check if the list elements are sorted and returns: 1 - if the list is sorted in ascending order, 2 – if the list is sorted in descending order, and 0 – if the list is not sorted.Q8: use Python Write a function return_odd that will take a list as its input and return a list of all the odd values as its output. Note that this differs from what you did above in two ways: (1) it returns the values, not the index, and (2) it's looking for odd values, not even. For example: >>> return_odd([1, 2, 3]) [1, 3] >>> return_odd([2, 4, 6]) [] In [ ]: