Exercise classes of binary search tree (node ​​and tree), functions of inserting an organ into a tree, deleting a tree, searching and deleting an organ in a tree while maintaining the structure of a search tree Return the first character in the string that appears exactly once Create a list of numbers from 0… n randomly where each number appears once in exactly n complexities Given a square matrix to implement a function that rotates the matrix 90 degrees counterclockwise Given an array of numbers Create another array that contains for a number in the given array the next number closest to an array that is larger than it, in case no 1 is put. In nlogn complexities Characterization of parking system, design, inheritance class disabled spear, motorcycle, standard, functions to check if there is available parking, etc.