Data Structures

1. Write a non-recursive metod for Depth-First Search in a graph. You may extend the class LinkedGraph. 2. Write a java program to implement the last fit bin packing strategy that puts each object into the right most bin into which it fits. If an object fits in no bin a new bin is started. [login to view URL] a method which checks if the tree is a HBLT (Height Biased Leftist Tree). May extend LinkedBinaryTree You don't have to extend the class. ## Deliverables 1. Write a non-recursive metod for Depth-First Search in a graph. You may extend the class LinkedGraph. 2. Write a java program to implement the last fit bin packing strategy that puts each object into the right most bin into which it fits. If an object fits in no bin a new bin is started. [login to view URL] a method which checks if the tree is a HBLT (Height Biased Leftist Tree). May extend LinkedBinaryTree 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. ## Platform Windows XP ## Deadline information I need this code today which is short notice. I read your ratings and noticed that you are quick and wanted to see if yo are interested?