Do a program that will read names from a file and put them in a binary search tree. Put in a printMap function that will print the form of the tree using just the first 2 letters of each name in printing the form.
Print the names inorder (use passing of a function to print the node). Have it also search for a name that is in the binary search tree and a name that is not (your choice) – it should say it found it and the name or didn't find it (and the name, of course). Also, remove a name (any), print the tree and print the map.
For example the data of: Fred Mertz, Betty Boop, Abner Little, Lucy Bee, Georgie Poo, Zac Smith
Should print out:
Ab Ge Za
Try the following data:
19 pekerja bebas membida secara purata $28 untuk pekerjaan ini
Hi there, I went through the requirements. I'd like to do this project if given the opportunity. I've done BST a lot of times. Let me know if you are interested.
HI..i am good at core C++ programming for console based desktop applications and can help you implement the BST and its operations and pretty print it on console.
Hey I am an expert C/C++ programmer. I have finished many similar project using different types of data structure including linked lists. This task is simple and could be done in few hours
Hi. I have review your project description. I have full experiences in Development. I am very interested in your project and also ready to start work immediately. Hoping for your soon Reply. Thank You Regard.
I read your project description and i'm confident that i will make BST Algorithm in C++. Tree Traversal: Pre-Order, In-Order, Post-Order. Price is negotiable. Thanks.