News for hackers. Stuff that matters.

A comment on I interviewed at six top companies in Silicon Valley in six days. Parent comment

Re:I interviewed at six top companies in Silicon Valley in s... by magicalhippo on Friday January 18, 2019 @05:39PM (#18943795)
I didn't know about "BFS trees", do you have any references? I tried Googling but I could only find breadth-first searching (which I do know well, though apparently not the acronym BFS), but that's just a traversal algorithm.
[ Parent | on HN ]
Re:I interviewed at six top companies in Silicon Valley in s... by reggieband on Friday January 18, 2019 @05:46PM (#18943845)
BFS is "Breadth first search". One tree you would do this on is a BST or "Binary Search Tree". Probably OP got the acronyms mixed up.
[ Parent | on HN ]
Re:I interviewed at six top companies in Silicon Valley in s... by vishnugupta on Friday January 18, 2019 @06:25PM (#18944100)
There's actually a thing called BFS tree. It's a tree that depicts the order of node expansion/visitation when a graph is traversed BFS. Even I wasn't aware of it until I recently read Peter Norvig's AI book. However, I'm not sure if the author referring this.
[ Parent | on HN ]
Re:I interviewed at six top companies in Silicon Valley in s... by magicalhippo on Friday January 18, 2019 @07:10PM (#18944319)
Right, since I didn't pick up on the acronym I thought I had missed something. Cheers!
[ Parent | on HN ]