Given two binary trees with head reference as T and S having at most N nodes. The task is to check if S is present as subtree in T. A subtree of a tree T1 is a tree T2 consisting of a node in T1 and all of its descendants in T1 You don't need to read input or print anything. Your task is to complete the function isSubtree() that takes root node of S and T as parameters and returns 1 if S is a subtree of T else 0. Expected Time Complexity: O(N). Expected Auxiliary Space: O(N). Constraints: 1 <= Number of nodes <= 105 1 <= Value of nodes <= 104

Q: Sets are collections (1) without defined order and (2) not allowing duplication. Multisets, also…

A: // Here's the implementation of bag-union and bag-intersection in Racket: (define (bag-union bag1…

Q: without defined order but which permit duplication, i.e., more than one element. We define the…

A: Given :   sum : List × List -&gt; ListThis function should take as arguments two lists representing…

Q: Create a function that would accept an integer as level or depth of the tree and display the…

A: define result="1"; for(let i=0;i&lt;num;i++)  {    for(let j=0;j&lt;=i;j++)    {…

Q: I need help coding an ordinary  BST  data structure in Java from scratch without using BST library…

A: In this question, we have to code BST data structure operation using Java Program Let's code

Q: Given a singly linked list and a number k, write a function to find the (n/k)-th element, where n is…

A: Code: #include &lt;iostream&gt;#include&lt;math.h&gt;using namespace std; struct node{    int data;…

Q: Write a program named ProblemA.cpp that implements the following functions using recursion. Make a…

A: Binary Search Tree The Binary tree consists of the nodes where the left side key value of the nodes…

Q: Let xHead, yHead and zHead be the head pointers of 3 linked lists of integers (called X-list, Y-list…

A: All the code already you have. I have implemented only  merging the two list in third list  so copy…

Q: be able to accept a number of vertices, create an cycleusing adjacency list data structure and…

A: It is defined as a general-purpose, procedural, imperative computer programming language developed…

Q: his assignment requires you to write a non-verbose input-driven java program for maintaining a…

A: An implementation of a menu-driven Binary Search Tree code in Java written below. The code has all…

Q: Write a recursive Racket function "keep-greater-rec" that takes as parameters two functions, f and…

A: The output for the above given question is given below:

Q: Sets are collections (1) without defined order and (2) not allowing duplication. Multisets, also…

A: Here's the implementation of bag-union and bag-intersection in Racket: (define (bag-union bag1 bag2)…

Q: By using Java, Give the implementation of a function that displays elements greater that a given…

A: Please refer to the following step for the complete solution to the problem above.

Q: are to write the code for the addLongInt function. Other parts of the program should not be changed.…

A: Initialization:Initialize two LongInt objects, summand1 and summand2, to store the input…

Q: Given a singly linked list L, where x and y are two data elements that occupy the nodes NODEX and…

A: Answer: Introduction  Each element of a singly linked list is a distinct entity, making it a linear…

Q: What is the difference between a singly-linked list and a doubly-linked list?

A: Hey, since there are multiple questions posted, we will answer first question alone. If you want any…

Q: Assume, HEAD is the head-node of a doubly linked list (dll). Write a utility function givenValue,…

A: Here's an implementation of the addNodeAfterValue function in Python:

Q: Question 4: Assume a generic recursive relation is defined as : A[i] - p*A[i-1] + q where p and q…

A: The complete code is given below with output.

Q: Write a function(in pyhton) that takes a list of distinct integers l, and an integer k. Your…

A: The program is implemented in Python with structured program. In main the program has a list of…

Q: Prefixes For a list L, the prefix of L of length n is the first n items of L. For example, the…

A: def allPrefixes(L):    prefixes = [[]]    for i in range(len(L)):        prefixes.append(L[:i+1])…

Q: Write a Python function that takes in three parameters - an adjacency matrix of a simple directed…

A: Below I have provided Python Programming. Also, I have attached the screenshot of the code and…

Q: In this question, you are to implement two functions for reversing linked lists. One function,…

A: Provided the implementation of two functions for reversing the linked lists. one function is…

Q: Write a Python function that takes in three parameters - an adjacency matrix of a simple directed…

A: The trouble may be solved the use of any of the graph traversal and the use of positive sentinals…

Q: The level of a node in the tree is the number of nodes in the path from the root to the node…

A: Write a function in Racket to prune a tree based on the specified level. To do this, at first it…

Q: Define a recursive function createlntList for constructing a flat list of integers from a nested…

A: Below I have provided a  program for the given question. Also, I have attached a screenshot of the…

Q: curr = curr.next self.assertEqual(5, curr.val) tail = curr self.assert IsNone (tail.next)…

A: The code defines a Node class representing a node in a linked list. It also includes a function…

Q: In this problem you will implement a function called triangle_count which will take as input a graph…

A: The triangle graph is a planar undirected graph with three vertices and three edges in the shape of…

Q: Define a recursive function named trim; it takes as its arguments a linked list (the head node of…

A: Actually, python is a easiest programming language. It is a dynamically typed programming language.…

Q: .ctions pr OV isioned on the W hen your ne following actions to be performed on the BST. 1. Insert…

A: Below is the java code

Q: Sets are collections (1) without defined order and (2) not allowing duplication. Multisets, also…

A: Given: Sets and multisets Sets are collections without defined order and not allowing duplication…

Q: Develop a program that implements the POLYNOMIAL ADT using the LIST ADT. e POLYNOMIAL ADT is used to…

A: The polynomial ADT implementation can be used to find a real root of a given polynomial using the…

Q: Cut.1: Write a pseudocode program deck_1 that will take the number of cards in the deck and the cut…

A: The function first creates a list to represent the deck. This is done using the list() function,…