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 <= 1051 <= Value of nodes <= 104

Construct a Binary Search Tree (BST) using the data provided in shaded row and name it “BST-1”.                                                                                                                                                                50 45 65 60 75 90 15 35 70 45 55 40 20 80 95 85 25 50 74 5 Provide answers to the following considering your constructed BST-1: Write a C++ code that finds and delete a node having exactly two Childs in a BST. Simulate your code on BST-1 and provide a step-by-step procedure to delete “15” and “75” from it.

Your colleague proposed a different definition of a binary search tree: it is such binary tree with keys in the nodes that for each node the key of its left child (if exists) is bigger than its key, and the key of its right child (if exists) is less than its key. Is this a good definition for a binary search tree? A. Yes B. No​

Need help in building a binary expression tree. It gas to echo print each arithmetic infix expression and print its corresponding prefix expression. Also, after the binary expression tree is built, have to print the expression in prefix notation. Thank you!

What is need for finding minimum spanning tree?

I am to write a function that receives the root of a binary tree t and a number k and determine if the node where k is stored is the left child of its parent. if k is not in the tree, or does not have a parent, or is a right child the function should return false. Starting code: def is_left_child(t,k):    parent, x = t.find(k, return_parent = True)    return False

Draw a binary expression tree.   (2a  +  5b)  ^  3  *  (x   -  7y)  ^  4

Apply your knowledge of reverse BST to write a program to implement reverse binary search tree

Create a binary linked tree, and traverse the tree by using the recursive function. The structure of the tree is as follow: //PICTURE//   You should input the nodes in pre-order sequence. If a child of a node is NULL, input a space. Write the function of create binary tree, pre-order to print the nodes, in-order to print the nodes and post-order to print the nodes. Also Count the height of the tree.    PLEASE USE C LANGUAGE