++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

给定一个升序的数组，把他转换成一个高度平衡的二叉查找树

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

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

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
递归的方法：
test.cpp：
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
  
#include <iostream>
#include <cstdio>
#include <stack>
#include <vector>
#include "BinaryTree.h"

using namespace std;

/**
 * Definition for binary tree
 * struct TreeNode {
 * int val;
 * TreeNode *left;
 * TreeNode *right;
 * TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
TreeNode *tobst(vector<int> num, int begin, int end)
{

if(begin > end)
    {
        return NULL;
    }
    if(begin == end)
    {
        return new TreeNode(num[begin]);
    }
    int mid = begin + (end - begin) / 2;
    TreeNode *tmp = new TreeNode(num[mid]);
    tmp->left = tobst(num, begin, mid - 1);
    tmp->right = tobst(num, mid + 1, end);
    return tmp;
}

TreeNode *sortedArrayToBST(vector<int> &num)
{
    return tobst(num, 0, num.size() - 1);
}

vector<vector<int> > levelOrder(TreeNode *root)
{

vector<vector<int> > matrix;
    if(root == NULL)
    {
        return matrix;
    }
    vector<int> temp;
    temp.push_back(root->val);
    matrix.push_back(temp);

vector<TreeNode *> path;
    path.push_back(root);

int count = 1;
    while(!path.empty())
    {
        TreeNode *tn = path.front();
        if(tn->left)
        {
            path.push_back(tn->left);
        }
        if(tn->right)
        {
            path.push_back(tn->right);
        }
        path.erase(path.begin());
        count--;

if(count == 0)
        {
            vector<int> tmp;
            vector<TreeNode *>::iterator it = path.begin();
            for(; it != path.end(); ++it)
            {
                tmp.push_back((*it)->val);
            }
            if(tmp.size() > 0)
            {
                matrix.push_back(tmp);
            }
            count = path.size();
        }
    }
    return matrix;
}

// 树中结点含有分叉，
//                  4
//              /       \
//             2         6
//           /   \      /  \
//          1     3    5    7
int main()
{
    int arr[7] = {1, 2, 3, 4, 5, 6, 7};
    vector<int> num(arr, arr + 7);

TreeNode *root = sortedArrayToBST(num);

vector<vector<int> > ans = levelOrder(root);

for (int i = 0; i < ans.size(); ++i)
    {
        for (int j = 0; j < ans[i].size(); ++j)
        {
            cout << ans[i][j] << " ";
        }
    }
    cout << endl;
    DestroyTree(root);
    return 0;
}

 
结果输出：
4 2 6 1 3 5 7
BinaryTree.h:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
  
#ifndef _BINARY_TREE_H_
#define _BINARY_TREE_H_

struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

TreeNode *CreateBinaryTreeNode(int value);
void ConnectTreeNodes(TreeNode *pParent,
                      TreeNode *pLeft, TreeNode *pRight);
void PrintTreeNode(TreeNode *pNode);
void PrintTree(TreeNode *pRoot);
void DestroyTree(TreeNode *pRoot);

#endif /*_BINARY_TREE_H_*/
BinaryTree.cpp:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
  
#include <iostream>
#include <cstdio>
#include "BinaryTree.h"

using namespace std;

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

//创建结点
TreeNode *CreateBinaryTreeNode(int value)
{
    TreeNode *pNode = new TreeNode(value);

return pNode;
}

//连接结点
void ConnectTreeNodes(TreeNode *pParent, TreeNode *pLeft, TreeNode *pRight)
{
    if(pParent != NULL)
    {
        pParent->left = pLeft;
        pParent->right = pRight;
    }
}

//打印节点内容以及左右子结点内容
void PrintTreeNode(TreeNode *pNode)
{
    if(pNode != NULL)
    {
        printf("value of this node is: %d\n", pNode->val);

if(pNode->left != NULL)
            printf("value of its left child is: %d.\n", pNode->left->val);
        else
            printf("left child is null.\n");

if(pNode->right != NULL)
            printf("value of its right child is: %d.\n", pNode->right->val);
        else
            printf("right child is null.\n");
    }
    else
    {
        printf("this node is null.\n");
    }

printf("\n");
}

//前序遍历递归方法打印结点内容
void PrintTree(TreeNode *pRoot)
{
    PrintTreeNode(pRoot);

if(pRoot != NULL)
    {
        if(pRoot->left != NULL)
            PrintTree(pRoot->left);

if(pRoot->right != NULL)
            PrintTree(pRoot->right);
    }
}

void DestroyTree(TreeNode *pRoot)
{
    if(pRoot != NULL)
    {
        TreeNode *pLeft = pRoot->left;
        TreeNode *pRight = pRoot->right;

delete pRoot;
        pRoot = NULL;

DestroyTree(pLeft);
        DestroyTree(pRight);
    }
}
 
 
 


												


											
【二叉查找树】04根据升序数组构造二叉查找树【Convert Sorted Array to Binary Search Tree】的更多相关文章
	

    
						
  1. [LeetCode] 108. Convert Sorted Array to Binary Search Tree ☆(升序数组转换成一个平衡二叉树)
		
    108. Convert Sorted Array to Binary Search Tree 描述 Given an array where elements are sorted in ascen ...
    
		
    2. 
						
  2. LeetCode 108. 将有序数组转换为二叉搜索树(Convert Sorted Array to Binary Search Tree) 14
		
    108. 将有序数组转换为二叉搜索树 108. Convert Sorted Array to Binary Search Tree 题目描述 将一个按照升序排列的有序数组,转换为一棵高度平衡二叉搜索 ...
    
		
    3. 
						
  3. 108. Convert Sorted Array to Binary Search Tree 109. Convert Sorted List to Binary Search Tree -- 将有序数组或有序链表转成平衡二叉排序树
		
    108. Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascendin ...
    
		
    4. 
						
  4. LeetCode 108. Convert Sorted Array to Binary Search Tree （将有序数组转换成BST）
		
    108. Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascendin ...
    
		
    5. 
						
  5. Convert Sorted Array to Binary Search Tree
		
    Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending ord ...
    
		
    6. 
						
  6. LeetCode:Convert Sorted Array to Binary Search Tree,Convert Sorted List to Binary Search Tree
		
    LeetCode:Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in asce ...
    
		
    7. 
						
  7. Convert Sorted List to Binary Search Tree&&Convert Sorted Array to Binary Search Tree——暴力解法
		
    Convert Sorted List to Binary Search Tree Given a singly linked list where elements are sorted in as ...
    
		
    8. 
						
  8. LeetCode108——Convert Sorted Array to Binary Search Tree
		
    题目: Given an array where elements are sorted in ascending order, convert it to a height balanced BST ...
    
		
    9. 
						
  9. 37. leetcode 108. Convert Sorted Array to Binary Search Tree
		
    108. Convert Sorted Array to Binary Search Tree 思路:利用一个有序数组构建一个平衡二叉排序树.直接递归构建,取中间的元素为根节点,然后分别构建左子树和右 ...
    
		
    10. 
						
  10. 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 ...
    
		
    11. 
		

	


随机推荐
	

    
									
  1. iptables启动脚本分析
			
    #!/bin/sh # # iptables Start iptables firewall # # chkconfig: 2345 08 92 # description: Starts, stop ...
    
			
    2. 
						
  2. 动态创建Lambda表达式实现高级查询
			
    需求简介 最近这几天做的东西总算是回归咱的老本行了,给投资管理项目做一个台账的东西,就是类似我们的报表.其 中有一个功能是一个高级查询的需求,在查询条件方面大概有7.8个查询条件.需求就是如果一个条件 ...
    
			
    3. 
						
  3. Tkinter 控件详细介绍
			
    Tkinter 控件详细介绍 1.Button 按钮.类似标签,但提供额外的功能,例如鼠标掠过.按下.释放以及键盘操作/事件 2.Canvas 画布.提供绘图功能(直线.椭圆.多边形.矩形) ;可以包 ...
    
			
    4. 
						
  4. Spring框架结构
			
    在processOn思维导图上看的一个程序员写的,挺不错的,分享出来,便于学习和回顾.
    
			
    5. 
						
  5. J - 组合
			
    J - 组合 Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%lld & %llu Description 有两 ...
    
			
    6. 
						
  6. 广告 竞价排名   import Levenshtein as Le          seqratio_res = Le.seqratio(chk_name_lsit, cmp_)
			
    pip install python-Levenshtein from openpyxl import Workbook import xlrd import time import Levensht ...
    
			
    7. 
						
  7. 我的Android进阶之旅------>android中getLocationInWindow 和 getLocationOnScreen的区别
			
    View.getLocationInWindow(int[] location) 一个控件在其父窗口中的坐标位置 View.getLocationOnScreen(int[] location) 一个 ...
    
			
    8. 
						
  8. Django利用form进行显示
			
    form的显示部分主要分为2部分:1.统一显示(表单里的所有字段): a.{{form.as_table}} b.{{form.as_p}}2.显示部分字段: {{ field.label_tag } ...
    
			
    9. 
						
  9. Java多线程系列 JUC线程池05 线程池原理解析(四)
			
    转载 http://www.cnblogs.com/skywang12345/p/3544116.html  https://blog.csdn.net/programmer_at/article/d ...
    
			
    10. 
						
  10. 【leetcode刷题笔记】Rotate List
			
    Given a list, rotate the list to the right by k places, where k is non-negative. For example:Given 1 ...
    
			
    11.