Does anyone know anything about Python, the programming language? Anyway, I need to create a binary search tree. I am having trouble printing out the search tree diagram. You can an example of the code in Python.  Also, for the optimal cost binary search tree, do you need to do some sort of traversal, pre-order, post-order

The improved algorithm for finding the occurrences of sequence P[1, . . . , m]in sequence T[1, . . . , n] can also be implemented in Perl in a straightforwardway, as shown in the following Perl script. Recall that the suffix array of thesequence T[1, . . . , n] will be a permutation of array positions 0, 1, . . . , n − 1,because Perl arrays do not start with position 1 but, rather, with position 0.

I need to construct a optimal binary search tree (OBST).  I am using Python to create this code. I already started creating the binary search tree. I need help trying to implement the optimal binary search tree. I did the class and then I did the insertion next to add the nodes. There needs to be at least 20 nodes. After that, I'm stuck. Not sure what code is needed to add for optimal cost.  Criteria from my assignment: Contains at minimum 20 nodes.  All paths must have a cost between 1-15. You must use each cost at least once with the remaining costs of your choice in the same range. All nodes must be able to communicate with all other nodes (does not have to be a direct path) Each node can only connect to, at maximum, 5 other nodes. The cost of an extra hop is 1 1/2 times the cost of the second path and 2 times the cost of a third path.  Any path greater than 3 is at the same cost as the third. This is what is required for us in the assignment.  My Code in Python: class BST:def…

Hello, I have this exercise of algorithm could you help me to solve it? in C++ or C#