摘要:
CompanyMassMutualDate30/09/15LocationBoston, MAPositionApplication DeveloperIt's not a coding interview. The interviewer only asked me questions about... 阅读全文
posted @ 2015-10-01 07:22
树獭君
阅读(243)
评论(0)
推荐(0)
摘要:
Postorder: first, visit left child, then, parent, last, is to visit right child.The postorder traversal result of above tree is {4,6,5,2,3,1}.Key diff... 阅读全文
posted @ 2015-10-01 06:45
树獭君
阅读(153)
评论(0)
推荐(0)
摘要:
Preorder: first, visit parent node, then, left child, last is to visit right child.Algorithm 1 -- DFS & StackWe can use stack to store left child and ... 阅读全文
posted @ 2015-10-01 02:22
树獭君
阅读(184)
评论(0)
推荐(0)
摘要:
QuestionThere are a total ofncourses you have to take, labeled from0ton - 1.Some courses may have prerequisites, for example to take course 0 you have... 阅读全文
posted @ 2015-10-01 00:05
树獭君
阅读(207)
评论(0)
推荐(0)

浙公网安备 33010602011771号