Vulkan

2014年4月17日

Cracking The Coding Interview4.8

摘要: //You are given a binary tree in which each node contains a value. Design an algorithm to print all paths which sum up to that value. Note that it can... 阅读全文

posted @ 2014-04-17 22:27 Vulkan 阅读(135) 评论(0) 推荐(0) 编辑

Cracking The Coding Interview 4.7_暂存

摘要: //原文://// You have two very large binary trees: T1, with millions of nodes, and T2, with hundreds of nodes. Create an algorithm to decide if T2 is a s... 阅读全文

posted @ 2014-04-17 15:06 Vulkan 阅读(133) 评论(0) 推荐(0) 编辑

Cracking The Coding Interview 4.6

摘要: //原文://// Design an algorithm and write code to find the first common ancestor of two nodes in a binary tree. Avoid storing additional nodes in a data... 阅读全文

posted @ 2014-04-17 14:15 Vulkan 阅读(128) 评论(0) 推荐(0) 编辑

导航