Vulkan

2014年4月16日

Cracking The Coding Interview4.5

摘要： //原文：//// Write an algorithm to find the ‘next’ node (i.e., in-order successor) of a given node in a binary search tree where each node has a link to ... 阅读全文

posted @ 2014-04-16 14:54 Vulkan 阅读(104) 评论(0) 推荐(0) 编辑

Cracking The Coding Interview 4.4

摘要： //Given a binary search tree, design an algorithm which creates a linked list of all the nodes at each depth (i.e., if you have a tree with depth D, y... 阅读全文

posted @ 2014-04-16 11:56 Vulkan 阅读(124) 评论(0) 推荐(0) 编辑

导航