[[File:WebPageTree.png|900px]]
Intuition:*We treat each internal page as a tree node. Each node can have multiple children. *Taking the above picture as an example, the homepage is the first tree node that we will be given as an input to our function, and it has 4 children: page 1, page 2, page 3, and page 4*Given the above intuitionidea, we have built 2 following algorithms to find all internal links of a web page with 2 given user inputs: homepage url and depth
*'''Breadth-First Search(BFS)approach''': we examine all pages(nodes) at the same depth before going down to the next depth.