导航

2016年3月28日

摘要: Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia 阅读全文

posted @ 2016-03-28 01:53 CSU蛋李 阅读(196) 评论(0) 推荐(0) 编辑

摘要: Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 - 阅读全文

posted @ 2016-03-28 00:51 CSU蛋李 阅读(162) 评论(0) 推荐(0) 编辑