leetcode -day19 Convert Sorted List to Binary Search Tree
1、
Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
分析:将一个升序排列的链表转换为平衡二叉搜索树,采用递归的方式,先找到链表的中点,作为二叉树的根,然后递归求解左右子树。
如下:
class Solution {
public:TreeNode *sortedListToBST(ListNode *head) {if(!head){return NULL;}if(!head->next){return new TreeNode(head->val);}ListNode* midNode = findMidNode(head);TreeNode* root = new TreeNode(midNode->val);TreeNode* leftSubTree = sortedListToBST(head);TreeNode* rightSubTree = sortedListToBST(midNode->next);if(leftSubTree){root->left = leftSubTree;}if(rightSubTree){root->right = rightSubTree;}return root;}ListNode* findMidNode(ListNode* head){ListNode* node1 = head;if(!node1->next){return node1;}ListNode* node2 = head->next;while(node2 && node2->next && node2->next->next){node2 = node2->next;node2 = node2->next;node1 = node1->next;}ListNode* midNode = node1->next;node1->next = NULL;return midNode;}
};
leetcode -day19 Convert Sorted List to Binary Search Tree相关推荐
- LeetCode: 109. Convert Sorted List to Binary Search Tree
题目 Given a singly linked list where elements are sorted in ascending order, convert it to a height b ...
- 【链表递归构造二叉树】LeetCode 109. Convert Sorted List to Binary Search Tree
LeetCode 109. Convert Sorted List to Binary Search Tree Solution1:我的答案 偷鸡摸狗的做法 /*** Definition for s ...
- 【数组递归构造二叉树】LeetCode 108. Convert Sorted Array to Binary Search Tree
LeetCode 108. Convert Sorted Array to Binary Search Tree Solution1:我的答案 构造二叉树利用递归 /*** Definition fo ...
- LeetCode: 108. Convert Sorted Array to Binary Search Tree
题目 Given an array where elements are sorted in ascending order, convert it to a height balanced BST. ...
- LeetCode OJ - Convert Sorted List to Binary Search Tree
题目: Given a singly linked list where elements are sorted in ascending order, convert it to a height ...
- LeetCode 108. Convert Sorted Array to Binary Search Tree
题目: Given an array where elements are sorted in ascending order, convert it to a height balanced BST ...
- leetcode 108. Convert Sorted Array to Binary Search Tree | 108. 将有序数组转换为二叉搜索树(Java)
题目 https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ 题解 经典二分,不解释了,直接看代码 /*** ...
- LeetCode 109. Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height bala ...
- Convert Sorted Array to Binary Search Tree - LeetCode
目录 题目链接 注意点 解法 小结 题目链接 Convert Sorted Array to Binary Search Tree - LeetCode 注意点 不要访问空结点 题目要求的是平衡二叉搜 ...
最新文章
- des加密去掉特殊字符_对称加密中的数据填充
- [剑指offer][JAVA]面试题第[03]题[数组中的重复数字][HashSet]
- java 静态方法_80后程序员,教你学Java核心技术:用户自定义类+静态域静态方法
- 软工第二次结对作业---部门录取方案实现
- java必会的英语单词
- 设计模式-创建型模式-模板方法
- SASS 的相关函数
- 项目管理之我见:程序开发步骤
- 禁用联想笔记本电脑自带的键盘
- 传智播客javascript视频教程(杨中科)学习笔记
- 自定义VB程序加密方案
- 日期计算(来自计蒜客)
- 一篇文章读懂 Ad Network、Ad Exchange、DSP、SSP、DMP的区别?
- #八、古老的查表计算器--图表
- 面向汽车企业的PLM知识管理
- 「AI芯片公司」比特大陆的路线图上,除了四款TPU还有在这三个产业落地的野心
- 摘几个陈年高校BBS的冷笑话
- PhpStrom更改配置文件的路径,重装或更新版本后不用重新配置参数
- 银行网银与支付渠道概述
- 基于java的文本/论文查重