write a c++ code using binary search tree to store ten names of cities, search city names in tree, remove three cities name, beside the used cities in code add two new names of cities and search those newly added cities (code consist of all of above tasks)

write a c++ program to find words in the dictionary using the trees data structure.

answer in C Step 1: Define your Tree data structure Define the tree struct and relevant functions in an appropriately named .h file, such as tree.h. Recall, with Trees, every node in a tree is also a tree. So, like a linked list, the root of the tree is just a TreeNode, and has children that are TreeNodes (or whatever you want to call them). CreateTreeNode(char* path, char* name) AddChild(TreeNode* root, char* path, char* name) DestroyTreeNode(TreeNode*) Now that you've defined a tree node, use that to implement a Queue that holds TreeNodes. The structure and functions should be declared in a .h file, and implemented in a .c file. You'll need the following operations: Enqueue(TreeNode*) Dequeue(TreeNode*) Depending on how you implement it, you may need to include Create() and Destroy() functions. However, as noted above, if you want to just use an array defined globally, that is fine for this assignment. Implement a Stack that holds TreeNodes. The structure and functions should be…

In Java,What is the maximum number of comparisons that a binary search function will make when searching for a value in a 2000-elements array?  why?What is the difference between a binary tree and a binary search tree?

C++ please  Please complete Programming Exercise 4, from pages 1402, from chapter 19 from your textbook.  Write a function, singleParent, that returns the number of nodes in abinary tree that have only one child. Add this function to the classbinaryTreeType and create a program to test this function. (Note: Firstcreate a binary search tree.)

When compared to alternative data structures like a linked list or an array, how are binary search trees better?

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

Use C++ to: implement binary search tree to store integer number insert, delete print all elements ( LRV, LVR, VLR) This is data structure algorithm exercise!!

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