Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

首先我是要AVL树的创建过程进行操作，不过提交之后出现超时，但还是让我将AVL树的创建过程实现了一遍，记录一下：

C++实现代码：

#include<iostream>
#include<new>
#include<vector>
#include<cmath>
using namespace std;//Definition for binary tree
struct TreeNode
{int val;TreeNode *left;TreeNode *right;TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};class Solution
{
public:TreeNode *sortedArrayToBST(vector<int> &num){if(num.empty())return NULL;TreeNode *root=NULL;int i;for(i=0; i<(int)num.size(); i++)insert(root,num[i]);return root;}void insert(TreeNode *&root,int key){int lhigh,rhigh;if(root==NULL){root=new TreeNode(key);if(root==NULL)return;}else if(key<root->val){insert(root->left,key);lhigh=maxDepth(root->left);rhigh=maxDepth(root->right);if(abs(lhigh-rhigh)>1){if(key<root->left->val)SingleRotateWithLeft(root);elseDoubleRotateWithLeft(root);}}else{insert(root->right,key);lhigh=maxDepth(root->left);rhigh=maxDepth(root->right);if(abs(lhigh-rhigh)>1){if(key>root->right->val)SingleRotateWithRight(root);elseDoubleRotateWithLeft(root);}}}int maxDepth(TreeNode *root){if(root){if(root->left==NULL&&root->right==NULL)return 1;int leftDepth=maxDepth(root->left);int rightDepth=maxDepth(root->right);return leftDepth>= rightDepth ?(leftDepth+1):(rightDepth+1);}return 0;}void SingleRotateWithLeft(TreeNode *&root){TreeNode *l=root->left;root->left=l->right;l->right=root;root=l;}void SingleRotateWithRight(TreeNode *&root){TreeNode *r=root->right;root->right=r->left;r->left=root;root=r;}void DoubleRotateWithLeft(TreeNode *&root){SingleRotateWithRight(root->left);SingleRotateWithLeft(root);}void DoubleRotateWithRight(TreeNode *&root){SingleRotateWithLeft(root->right);SingleRotateWithRight(root);}void inorder(TreeNode *root){if(root){inorder(root->left);cout<<root->val<<" ";inorder(root->right);}}
};int main()
{Solution s;TreeNode *root=NULL;vector<int> vec={1,2,3,4,5,6,7,8,9,10};root=s.sortedArrayToBST(vec);s.inorder(root);cout<<endl;cout<<s.maxDepth(root)<<endl;
}

运行结果：

提交的代码：

#include<iostream>
#include<new>
#include<vector>
#include<cmath>
using namespace std;//Definition for binary tree
struct TreeNode
{int val;TreeNode *left;TreeNode *right;TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};class Solution
{
public:TreeNode *sortedArrayToBST(vector<int> &num){if(num.empty())return NULL;//递归的退出条件，一定要写哦TreeNode *root=NULL;int left=0;int right=num.size()-1;int mid=(left+right)/2;root=new TreeNode(num[mid]);vector<int> l(mid);vector<int> r(right-mid);int i;for(i=0;i<mid;i++)l[i]=num[i];for(i=mid+1;i<(int)num.size();i++)r[i-mid-1]=num[i];root->left=sortedArrayToBST(l);root->right=sortedArrayToBST(r);return root;}int maxDepth(TreeNode *root){if(root){if(root->left==NULL&&root->right==NULL)return 1;int leftDepth=maxDepth(root->left);int rightDepth=maxDepth(root->right);return leftDepth>= rightDepth ?(leftDepth+1):(rightDepth+1);}return 0;}TreeNode* SingleRotateWithLeft(TreeNode *&root){TreeNode *l=root->left;root->left=l->right;l->right=root;return l;}TreeNode* SingleRotateWithRight(TreeNode *&root){TreeNode *r=root->right;root->right=r->left;r->left=root;return r;}TreeNode* DoubleRotateWithLeft(TreeNode *&root){SingleRotateWithRight(root->left);return SingleRotateWithLeft(root);}TreeNode* DoubleRotateWithRight(TreeNode *&root){SingleRotateWithLeft(root->right);return SingleRotateWithRight(root);}void inorder(TreeNode *root){if(root){inorder(root->left);cout<<root->val<<" ";inorder(root->right);}}
};int main()
{Solution s;TreeNode *root=NULL;vector<int> vec={1,2,3,4,5,6,7,8,9,10};root=s.sortedArrayToBST(vec);s.inorder(root);cout<<endl;cout<<s.maxDepth(root)<<endl;
}

Convert Sorted Array to Binary Search Tree相关推荐

Convert Sorted Array to Binary Search Tree - LeetCode
目录题目链接注意点解法小结题目链接 Convert Sorted Array to Binary Search Tree - LeetCode 注意点不要访问空结点题目要求的是平衡二叉搜 ...
LeetCode: Convert Sorted Array to Binary Search Tree 解题报告
Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending ord ...
【数组递归构造二叉树】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. ...
Convert Sorted Array to Binary Search Tree With Minimal Height
Given a sorted (increasing order) array, Convert it to create a binary tree with minimal height. Exa ...
[LeetCode] Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. Hi ...
[LeetCode]Convert Sorted Array to Binary Search Tree
题目描述:(链接) Given an array where elements are sorted in ascending order, convert it to a height balanc ...
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 python3 简单题108. Convert Sorted Array to Binary Search Tree
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百零八题 (1)题目英文: Given an array where elem ...

Convert Sorted Array to Binary Search Tree

Convert Sorted Array to Binary Search Tree相关推荐

最新文章

热门文章