114. Flatten Binary Tree to Linked List
题目要求根据中序遍历，将树的左节点全部移到右节点。 思路：在节点处，判断是否存在左子节点，若存在，则将左子节点拉伸并连接到右子节点之间。 代码： TreeNode *getTail(TreeNode *head) //获得链表末尾
{
while(head->right)
{
head=head->right;
}
return head;
}
相关文章
- 1. 114. Flatten Binary Tree to Linked List
- 2. LeetCode—114. Flatten Binary Tree to Linked List
- 3. [LeetCode]114.Flatten Binary Tree to Linked List
- 4. 114. Flatten Binary Tree to Linked List(M)
- 5. leetcode -- 114. Flatten Binary Tree to Linked List
- 6. Flatten Binary Tree to Linked List
- 7. LeetCode - Flatten Binary Tree to Linked List
- 8. Flatten Binary Tree to Linked List [LeetCode]
- 9. 【leetcode】114. 二叉树展开为链表( Flatten Binary Tree to Linked List)
- 10. [Swift]LeetCode114. 二叉树展开为链表 | Flatten Binary Tree to Linked List
- 更多相关文章...
- • Redis链表（linked-list）数据结构和常用命令 - Redis教程
- • Scala List(列表) - Scala教程
- • 算法总结-深度优先算法
- • 使用阿里云OSS+CDN部署前端页面与加速静态资源
相关标签/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
欢迎关注本站公众号,获取更多信息
相关文章
- 1. 114. Flatten Binary Tree to Linked List
- 2. LeetCode—114. Flatten Binary Tree to Linked List
- 3. [LeetCode]114.Flatten Binary Tree to Linked List
- 4. 114. Flatten Binary Tree to Linked List(M)
- 5. leetcode -- 114. Flatten Binary Tree to Linked List
- 6. Flatten Binary Tree to Linked List
- 7. LeetCode - Flatten Binary Tree to Linked List
- 8. Flatten Binary Tree to Linked List [LeetCode]
- 9. 【leetcode】114. 二叉树展开为链表( Flatten Binary Tree to Linked List)
- 10. [Swift]LeetCode114. 二叉树展开为链表 | Flatten Binary Tree to Linked List