CPP (C++ language only) 1. store a Q&As in a tree 2. use the tree to make decisions based on user prompts

C++ You are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.   Example 1: diagram for example 1 attached   Input: root = [4,2,7,1,3], val = 5 Output: [4,2,7,1,3,5] Explanation: Another accepted tree is: Example 2: Input: root = [40,20,60,10,30,50,70], val = 25 Output: [40,20,60,10,30,50,70,null,null,25] Example 3: Input: root = [4,2,7,1,3,null,null,null,null,null,null], val = 5 Output: [4,2,7,1,3,5]   Constraints: The number of nodes in the tree will be in the range [0, 104]. -108 <= Node.val <= 108 All the values Node.val are unique. -108 <= val <= 108 It's guaranteed that val does not exist in the original BST.

C++  Sketch a left rotation on an AVL.  build the following AVL tree: insert 5insert 2insert 7insert 9insert 11  follow the insert algorithm draw out the original tree prior to any rotations-which node breaks the avl condition-label N, R, A, B, C, and the parent of N.-draw out the final tree after any rotation

AVL Tree Implementation program  Important note: You must separate your program into three files: header file (*.h), implementation file (*.cpp) and main file (*.cpp).   Write a program to build an AVL tree by accepting the integers input from users.  For each input, balance the tree and display it on the screen; you then calculate the indorder traversals as well.  There should be a menu to drive the program.  It should be similar as follows:                          AVL Tree Implementation        A: Insert an integer to tree and show the balanced tree at each insertion.        B: Display the balanced tree and show inorder traversal.        C: Exit To be sure, your program is correctly working, use the following data to test AVL tree: 15, 18, 10, 7, 57, 6, 13, 12, 9, 65, 19, 16, 23 You should perform more test with different data sets.

can you give me the java code to this problem