{"id":68558,"date":"2021-10-31T17:42:05","date_gmt":"2021-10-31T17:42:05","guid":{"rendered":"https:\/\/papersspot.com\/blog\/2021\/10\/31\/binarytree-binarysearchtree-adt\/"},"modified":"2021-10-31T17:42:05","modified_gmt":"2021-10-31T17:42:05","slug":"binarytree-binarysearchtree-adt","status":"publish","type":"post","link":"https:\/\/papersspot.com\/blog\/2021\/10\/31\/binarytree-binarysearchtree-adt\/","title":{"rendered":"BinaryTree&lt;&#8211;BinarySearchTree ADT"},"content":{"rendered":"<p>In this assignment, we will create, display, and search a Binary Search Tree of College objects. You are encouraged to reuse as much code as possible from previous assignments\/labs. <br \/>The assignment consists of the following classes\/files: <br \/>&#8220;search the BST (recursive private search function)&#8221; is the only thing that needs to be done. <br \/>BinaryNode.h (template, given) <br \/>BinaryTree.h (template, incomplete) <br \/>BinarySearchTree.h(template, incomplete) <br \/>main.cpp (incomplete) <br \/>College.cpp (incomplete) <br \/>College.h (incomplete)The program creates a BST of random integers. The insert and inorder traversal are given. <br \/>Your tasks: <br \/>reuse (with modifications if needed) the College class from previous assignments <br \/>rewrite the private insert as a recursive function <br \/>display the sorted data as shown below: <br \/>Inorder: <br \/> ABC 98 AB College 9998 <br \/> CC 10 Cuesta College 19135 <br \/> CPC 99 Cupertino College 9999 <br \/> \/\/ &#8230; and so on<br \/> display the tree as an indented list as shown below <br \/>1). FC<br \/> ..2). PCC<br \/> &#8230;.3). SBCC<br \/> \/\/ &#8230; and so on<br \/> display the leaves of the tree <br \/> ABC 98 AB College 9998 <br \/> DAC 1 De Anza College 19302 <br \/> IVC 9 Irvine Valley College 20577 <br \/> \/\/ &#8230; and so on<br \/> search the BST (recursive private search function) <br \/> Search<br \/> =======<\/p>\n<p> Enter a college code (or Q to stop searching) : <br \/> College &#8220;FHC&#8221; was not found in this list.<br \/> Accept lower and upper case letters. For instance, if the user enters dAc, the search result will show data for De Anza College instead of displaying the &#8220;not found&#8221; message. <br \/>Also, it is left for you to decide where the functions in charge of displaying the leaves of the tree should be placed. <\/p>\n","protected":false},"excerpt":{"rendered":"<p>In this assignment, we will create, display, and search a Binary Search Tree of College objects. You are encouraged to reuse as much code as possible from previous assignments\/labs. The assignment consists of the following classes\/files: &#8220;search the BST (recursive private search function)&#8221; is the only thing that needs to be done. BinaryNode.h (template, given) [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[10],"class_list":["post-68558","post","type-post","status-publish","format-standard","hentry","category-research-paper-writing","tag-writing"],"_links":{"self":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/68558","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/comments?post=68558"}],"version-history":[{"count":0,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/posts\/68558\/revisions"}],"wp:attachment":[{"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/media?parent=68558"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/categories?post=68558"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/papersspot.com\/blog\/wp-json\/wp\/v2\/tags?post=68558"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}