Convert Sorted List to Binary Search Tree
来源:互联网 发布:java前后端分离session 编辑:程序博客网 时间:2024/05/18 01:05
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
思路1:最笨的方法,每次插入然后调整
思路2:由于是升序有序的,所以子树的根节点必然是中间的那个数,所以可以通过找到子链表的中间节点,两边递归实现
找到链表中间节点的方法:
auto pre = head;
auto slow = head;
auto fast = head;
while( fast && fast->next ){
pre = slow;
slow = slow->next;
fast = fast->next->next;
}
思路1:最笨的方法,每次插入然后调整
思路2:由于是升序有序的,所以子树的根节点必然是中间的那个数,所以可以通过找到子链表的中间节点,两边递归实现
找到链表中间节点的方法:
auto pre = head;
auto slow = head;
auto fast = head;
while( fast && fast->next ){
pre = slow;
slow = slow->next;
fast = fast->next->next;
}
0 0
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- convert sorted list to binary search tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- 一个标准的JavaBean具备哪些特点
- Word Ladder
- String,StringBuffer与StringBuilder的区别??
- 利用大内存提高磁盘性能
- HDU1875 畅通工程再续
- Convert Sorted List to Binary Search Tree
- ubuntu 常见问题
- AngularJs轻松入门(一)创建第一个应用
- 为什么中国没有疯狂的马斯克?
- Posts Tagged 【bfs】Maximum && Minimum Depth of Binary Tree
- const,template,pointer,virtual
- 图文解释XCode常用快捷键的使用
- 招聘那些事
- 四月英语总结——英语还需要坚持