write a binary expression tree from a prefix notation in c++

Write a C++ code that compare the times to traverse a list (containing a large number of elements) implemented in an array, in a simple linked list, and in an unrolled linked list.

Implement a C++ program to store Strings in Binary Search tree. Your program should have following functions: Insert Display Search Data structures in C++

For C++  in a doubly linked list, how would you print the list in reverse?? void double LL::printReverse()

Write a recursive C++ program that will output all the subsets of a set of n elements (without repeating any subsets).

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

write in C++ DATA STRUCTURES AND ALGORITHMS Give OUtPUT SCREENSHOT

For c++ programming languge:   How many comparisons are required in an array of 16 elements, if quicksort always chooses the largest element as pivot? What is the depth of the recursion tree?

In C++ when learning binary search trees, how can they be implemented into projects, with real actual examples?