Given a singly linked list where elements are sorted in ascending order, convert it to a height bala

将一个顺序链表转换成一棵二叉树

利用快慢指针，快指针比满指针每次多走一步

slow = slow->next;

fast = fast->next->next;

快指针走到尾，满指针走到中间点，中间点作为二叉树的根节点root，

root前的节点为左子树，root后的节点为右子树，递归

TreeNode* BST(ListNode* head, ListNode* tail)
{if (head == tail)return NULL;ListNode* slow = head;ListNode* fast = head;while (fast != tail && fast->next != tail){slow = slow->next;fast = fast->next->next;}if (fast->next != tail){slow = slow->next;}TreeNode* root = new TreeNode(slow->val);root->left = BST(head, slow);root->right = BST(slow->next, tail);return root;
}
TreeNode* sortedListToBST(ListNode *head)
{if (head == NULL)return NULL;elsereturn BST(head, NULL);
}

Given a singly linked list where elements are sorted in ascending order, convert it to a height bala相关推荐

python创建一个有序链表_Python实现单向有序链表（Singly linked list）
概念介绍上一博文已经介绍了Python实现单向无序链表的实现方式,这篇博文来介绍Python如何实现单向有序链表.有序和无序仅仅指节点所包含的数据成员的大小排列顺序,有序指各个节点按照节点数据成员的 ...
lintcode-easy-Delete Node in the Middle of Singly Linked List
Implement an algorithm to delete a node in the middle of a singly linked list, given only access to ...
基本的数据结构：单链表（Singly Linked List）
一.基本的数据结构:单链表(Singly Linked List) 什么是单链表? 下面是百度百科给出的官方解释: 单链表是一种链式存取的数据结构,用一组地址任意的存储单元存放线性表中的数据元素.链表 ...
单链表（Singly LInked LIst)
单链表(Singly Linked List) 单链表是比较常见的链表类型.其中每个节点都有一个指向序列下一个节点的指针.这意味着,对链表执行遍历时,只能在一个方向上从头到尾的遍历:为了能够访问链表中 ...
数据结构与算法（二）单链表（Singly linked list）
数据结构与算法(二)单链表(Singly linked list) 链表(Linked list) Python完整功能实现 LeetCode思想实践: 链这个东西大家一定都不陌生, 脖子上有项链, ...
Reverse a singly linked list python
Reverse a singly linked list. class Solution(object):def reverseList(self, head):""": ...
[LintCode] Delete Node in the Middle of Singly Linked List 在单链表的中间删除节点
Implement an algorithm to delete a node in the middle of a singly linked list, given only access to ...
LeetCode 206 Reverse a singly linked list.
Reverse a singly linked list. Hint: A linked list can be reversed either iteratively or recursively. ...
LintCode Delete Node in the Middle of Singly Linked List 在O(1)时间复杂度删除链表节点
中文描述: 给定一个单链表中的表头和一个等待被删除的节点(非表头或表尾).请在在O(1)时间复杂度删除该链表节点.并在删除该节点后,返回表头. 样例给定 1->2->3->4,和节 ...

Given a singly linked list where elements are sorted in ascending order, convert it to a height bala

Given a singly linked list where elements are sorted in ascending order, convert it to a height bala相关推荐

最新文章

热门文章