2016年7月4日
[LintCode] Flatten Binary Tree to Linked List 将二叉树展开成链表
摘要： Flatten a binary tree to a fake "linked list" in pre-order traversal. Here we use the right pointer in TreeNode as the next pointer in ListNode. Notic 阅读全文
posted @ 2016-07-04 23:44 Grandyang 阅读(1082) 评论(0) 推荐(0)
Fork me on GitHub