trees and algorithms

Question 1

define a tree

Answer 1

a graph where nodes are undirected and do not loop

Question 2

what data structure would you use for a breadth first search

Answer 2

queue

Question 3

describe djikstras algorithm

Answer 3

visit all nodes, starting with shortest range, update the shortest distance to the current node based on shortest distance so far, making sure nodes are visited once complete. then work backwards to confirm shortest path.