in c++, write a function to find the height of a specific node in a Binary Search Tree.

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

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

1. Create a Java program that prompts the user the initial choices for the Binary Search Treea. User chooses 1: Insert, User chooses 2: Delete, User chooses 3: Show Binary Tree, User chooses 4: Exit Program  2. Insertion in a tree should be such that it obeys the main properties of the binary search tree. The basic algorithm should be: a. If the node to be inserted is greater than the existing root, move down a level through the right pointer of the root. b. If the node to be inserted is lesser than the existing root, move down a level through the left pointer of the root. c. Repeat this process for all nodes till the leaves are reached. d. Insert the node as the left or right pointer for the leaf (based on its value - if it is smaller than the leaf, it should be inserted as the left pointer; if it is larger than the leaf, it should be inserted as the right pointer)  3. Deletion is a bit more complicated than insertion because it varies depending on the node that needs to be deleted…

Write a program in C/C++ to that receives N number of integer values from a user, stores the inputted values in a binary search tree, and performs some basic operations on the tree. The program displays the elements of the binary search tree in in-order traversal. The program then prompts the user to provide an integer number (target value) to search in the tree. If the target value does not appear in the tree, the program inserts the value in an appropriate place according to the property of node insertion of binary search tree. If the target value appears in the tree, the program deletes the target value from the tree and preserves the property of binary search tree. In both cases, the program displays the modified binary search tree in in- order traversal. Your program must contain the following user-defined functions: -  insertNode – this function inserts the user’s input and creates a binary search tree. -  inOrder – this function displays the entire tree in in-order traversal. -…

Write a program in C/C++ to that receives N number of integer values from a user, stores the inputted values in a binary search tree, and performs some basic operations on the tree. The program displays the elements of the binary search tree in in-order traversal. The program then prompts the user to provide an integer number (target value) to search in the tree. If the target value does not appear in the tree, the program inserts the value in an appropriate place according to the property of node insertion of binary search tree. If the target value appears in the tree, the program deletes the target value from the tree and preserves the property of binary search tree. In both cases, the program displays the modified binary search tree in in- order traversal. Your output format should be as shown in the test runs. Your program must contain the following user-defined functions: -  insertNode – this function inserts the user’s input and creates a binary search tree. -  inOrder – this…

C programming write a code that has ask the user to input how many numbers they are going to input and run that many times. then use a struct that points to a binary search tree to put in those numbers

Write a recursive function called "GetParent" in Binary Search Tree of the given node. You can take as many arguments as you like. Use the following structure definition.   struct TNode{     char NodeName[10];     TNode *LeftT, *RightT; } root;

PYTHON: Create a program that asks the user for the INORDER traversal and gives them a choice whether to pick the POSTORDER or the PREORDER, then, once they choose for either, ask their input. Let the program create a tree for the traversal from the user input. Once the program has created the tree, use the tree to identify all the inorder, postorder, and preorder traversals and print them. For instance, the user chooses POSTORDER; then, the program asks for the INORDER and POSTORDER input. The program will then identify the missing traversal - which is the PREORDER. Please have a brief explanation of each important line of your code if you can. The images below are examples of the expected output: