I need help with coding in C++ please: Write a program (in main.cpp) to do the following: a. Build a binary search tree T1. b. Do a postorder traversal of T1 and, while doing the postorder traversal, insert the nodes into a second binary search tree T2 . c. Do a preorder traversal of T2 and, while doing the preorder traversal, insert the node into a third binary search tree T3. d. Do an inorder traversal of T3. e. Output the heights and the number of leaves in each of the three binary search trees. The program should accept input and produce output similar to the example below: Enter numbers ending with -999: 10 5 7 -999 tree1 nodes in postorder: 7 5 10 tree2 nodes in preorder: 7 5 10 tree3 nodes in inorder: 5 7 10 tree1 height: 3 tree1 leaves: 1 tree2 height: 2 tree2 leaves: 2 tree3 height: 2 tree3 leaves: 2 The program has 3 tabs: main.cpp , binarysearchTree.h , and binaryTree.h

In C++, answer): Give the inorder, preorder,postorder traversal of the tree below (no spaces in your ART T H E T M A U X H S Y A

python: In a binary search tree, write another way of function that takes in a root, p, and checks whether the tree rooted in p is a binary search tree or not. What is the time complexity of your function? def is_bst(self, p):     root=p     def helper(root, l, r):         if not root:             return True         if not (left<root.val and root.val<right):             return False         return helper(root.l, l, root.val) and helper(root.r, root.val, r)       return helper(root, float('-inf'), float('inf'))

Please answer in c++ Please implement BST sort and test it for correctness. The program will prompt for the name of an input file and the read and process the data contained in this file. The file contains a sequence of integer values. Read them and construct a binary search tree from the values in the order they are read. Thus; the first number read will be the root of the tree. For this exercise, you may use dynamic data, but it is better to store the numbers sequentially in an array. You do not need to balance the tree as you construct it. When you have read the last value into the BST, conduct an in‐order traversal to output the values in ascending order. Print them 10 to a line in a 5‐character wide field.   Note: there may be duplicated value in the input file – in this case each copy of the number should be kept in the tree and output. E.g. if the input was 3 5 3, the output would be 3 3 5. As usual, do not use classes or STL. text file:…