Using dev c++, I need to implement my own Binary Search Tree. There will be one number per line and you should incrementally insert them into your binary search. You should keep inserting numbers until you read a -1. Construct a binary search tree based on the numbers given on stdin. Then print out the pre-order, in-order, and post-order traversals each on their own lines. You should print out the numbers separated by spaces and it is acceptable to have a space at the end of each line. Sample Input 50 30 35 01 24 58 62 32 -1 Sample Output: 50 30 24 35 32 61 58 62 24 30 32 35 50 58 61 62 24 32 35 30 58 62 61 50

Using dev c++, I need to implement my own Binary Search Tree. There will be one number per line and you should incrementally insert them into your binary search. You should keep inserting numbers until you read a -1. Construct a binary search tree based on the numbers given on stdin. Then print out the pre-order, in-order, and post-order traversals each on their own lines. You should print out the numbers separated by spaces and it is acceptable to have a space at the end of each line. Sample Input 50 30 35 01 24 58 62 32 -1 Sample Output: 50 30 24 35 32 61 58 62 24 30 32 35 50 58 61 62 24 32 35 30 58 62 61 50

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Can you help me write the code for this one please? Thank you
A singly linked list contains n - 1 strings that are binary representations of numbers from the set {0, 1,.…, n – 1} where n is an exact power of 2. However, the string corresponding to one of the numbers is missing. For example, if n = 4, the list will contain any three strings from 00, 01,10 and 11. Note that the strings in the list may not appear in any specific order. Also note that the length of each string is lgn, hence the time to compare two strings in O(lgn). Write an algorithm that generates the missing string in O(n).
Given a singly linked list L, where x and y are two data elements that occupy the nodes NODEX and NODEY with PREVIOUSX as the node, which is the previous node of NODEX, write a pseudo-code to swap the date x and y in list L by manipulating the links only (data swapping is not allowed). Assume that x and y are available in the list and are neither neighbors nor the end nodes of list L. For example, given the list L shown in Figure P6.10(a), with L, NODEX, NODEY and PREVIOUSX marked on it, the swapping should yield the list shown in Figure P6.10(b). NODEX and NODEY are neither immediate neighbors nor the end nodes of list L. Th PREVIOUS X NODE X ‘oddada g c PREVIOUS X (a) Before swapping g and x NODE Y с NODE Y X NODE X addgħa W (b) After swapping g and x Figure P6.10. Swapping of elements in a singly linked list by manipulating links i
Execute a program that will split a circularly linked list P with n nodes intotwo circularly linked lists P1, P2 with the first n/2 and the last n – n/2 nodes ofthe list P in them.
Think about how you search a dictionary: you start in themiddle either go left or go right until you find the word you’re looking foror can’t narrow the word list down any further. It’s possible to do thesame in a list of numbers. Write an algorithm that, given a list of numbersand a secret number to find, tells you where in the list (index) you canfind that number or tells you the number isn’t in the list.