5.3.4—二叉查找树—Convert Sorted Array to Binary Sear Tree

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

#include "BinaryTree.h"
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;
vector<int> path;
//===由有序数组构建BST
BinaryTreeNode *ConSortArrayToBST(int a[], int begin, int end)
{if (begin > end)return NULL;if (begin == end)return CreateBinaryTreeNode(a[(begin + end) / 2]);int mid = (begin + end) / 2;BinaryTreeNode *proot = CreateBinaryTreeNode(a[mid]);ConnectTreeNodes(proot, ConSortArrayToBST(a, begin, mid-1), ConSortArrayToBST(a, mid + 1, end));return proot;
}int main()
{const int n = 7;int a[n] = { 1, 3, 5, 7, 9, 11, 13 };int begin = 0;int end = n - 1;BinaryTreeNode *proot = ConSortArrayToBST(a, begin, end);PrintTree(proot);//===DestroyTree(proot);}

5.3.4—二叉查找树—Convert Sorted Array to Binary Sear Tree相关推荐

5.3.5—二叉查找树—Convert Sorted List to Binary Sear Tree
描述 Given a singly linked list where elements are sorted in ascending order, convert it to a height b ...
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 balanc ...
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] 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 ...

5.3.4—二叉查找树—Convert Sorted Array to Binary Sear Tree

5.3.4—二叉查找树—Convert Sorted Array to Binary Sear Tree相关推荐

最新文章

热门文章