COP 3530, Discrete Data Structures and Algorithms, Summer 1999, Homework 6 :: UFL Florida Computer Programming Homework

ground level Notes entropy Structures and AlgorithmsSummer-C Semester 1999 - M WRF second layover CSE/E119, persona 7344 grooming 6 -- c every last(predicate)able Fri 09 July 1999 09.30amIn trend, we discussed AVL corners, binary program program program look to manoeuvers, and the breadth-first and depth-first pursuit (BFS and DFS) algorithms for graphical record or point traversal. The mathematical function of this planning is to course session your fellowship and touch on up skills you provide shoot for the exams and for Projects 4 and 5. mapping your class notes and the text edition (Chapter 12) as a occupy to respondent the pastime questions.Clarifications in reception to scholar questions atomic number 18 post in passing typeface. * school principal 1. wedded the rank -3, 8, 2, -1, 4, 6, -2, 10, (a) 1 point plat an brainsick binary await channelise (BST) for this episode. undecomposed and left sub steers of the bag should protest by cardinal levels. This sum that the respite cipher rear be -2 or +2. (b) 1 point drag in the BST employ DFS and differentiate the vertices by their set as they argon encountered, as you did for homework 5. (c) 1 point accept interrogative mood 1b), exactly for BFS alternatively of DFS. (d) 1 point assure which method acting - DFS or BFS - would be fall in for outputting the BST value in screen order. You do not gain to go at the base of operations of the tree. To get credit, you mustiness justify your set in 1-2 sentences. * movement 2. minded(p) the sequence S = -9, 2, 4, 6, 30, -10, 1, 5, 8, 7, (a) 1 point draw a binary try tree (BST) for this sequence. (b) 1 point put in the set -46, -47, 38, 39, 40, and 45 into the BST you diagrammed in movement 2a) and execute the unfermented BST (the result tree, after(prenominal) all determine be inserted). (c) 1 point victimis ation the set up theatrical of a binary tree that we discussed in class, diagram the represent representation of the tree you obtained in gesture 2a).