Create tree data structures with breadth first search and depth first search algorithms

$250-750 USD

Closed

Posted

over 10 years ago

$250-750 USD

Paid on delivery

Write a function that will output breadth first search and depth first search order for a tree data structure. The tree shall only contain integers for it’s node. I expect the following: (1) A PHP class that represents a tree data structure. (2) A PHP function (BFS) that takes a tree as input and output the ordering of a breadth first search on the command line. (3) A PHP function (DFS) that will output a depth first search on the same tree (4) I should be able to run the class on the command line Notes: - Ensure that your function can handle cycles - Ensure that the nodes can only be integer When you apply to this job, answer the following questions. IF YOU DO NOT ANSWER THESE QUESTIONS, YOU WILL NOT BE CONSIDERED. (1) What is the complexity (O runtime) of BFS and DFS? (2) What is the difference between a stack and queue data structure? (3) How many hours will it take to do this job?

PHP

Software Architecture

Project ID: 5369404

About the project

7 proposals

Remote project

Active 10 yrs ago

Looking to make some money?

Email address

Benefits of bidding on Freelancer

Set your budget and timeframe

Get paid for your work

Outline your proposal

It's free to sign up and bid on jobs

7 freelancers are bidding on average $544 USD for this job

@mhmhz

Hi I offered to delivered a desktop application in C#. I worked before on BFS/DFS and applied it to several problem such as N-Puzzle I attached BFS application, you can set "Goal Node" and "Max depth". Freelancer not allow to attached any thing when set the bid, so you can reply me to be able to attached it. Thanks

$526 USD in 10 days

5.0

(119 reviews)

6.6

@urmate

HI Contact me for an efficient, well documented and perfect solution and development of your project. I ensure quality work with always on time delivery of project and dedicated support and follow up. Thanks Farah Saif

$257 USD in 2 days

5.0

(72 reviews)

5.8

@dobreiiita

Hi, I am Algorithm expert and interested in this project, Here are the answers 1. Runtime of BFS and DFS is O(V+E) where V is number of vertices and E is number of Edges. 2. Stack is a LIFO( Last in first out) whereas Queue is a FIFO( first in first out) data stcruture. 3. 5-6 hours. Thanks

$250 USD in 3 days

4.8

(52 reviews)

5.7

@Faylixe

(1) Compexity is O(n + m) with n number of node and m number of edge of the graph. (2) A stack is a Last In Last Out structure a a queue is a first in first out one. (3) Won't take me long, you will have it by tomorrow. I would say 3 hours to be large. I am a research and development engineer with a master in software engineering. I also worked two years in a university research lab. Such job is easy and would only takes me few hours. Please ask for more informations if needed. Regard

$250 USD in 3 days