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 balanced
BST.

#pragma once
#include<iostream>
struct BinaryTreeNode
{int                    m_nValue;BinaryTreeNode*        m_pLeft;BinaryTreeNode*        m_pRight;
};BinaryTreeNode* CreateBinaryTreeNode(int value);
void ConnectTreeNodes(BinaryTreeNode* pParent, BinaryTreeNode* pLeft, BinaryTreeNode* pRight);
void PrintTreeNode(BinaryTreeNode* pNode);
void PrintTree(BinaryTreeNode* pRoot);
void DestroyTree(BinaryTreeNode* pRoot);

#include "BinaryTree.h"BinaryTreeNode* CreateBinaryTreeNode(int value)
{BinaryTreeNode* pNode = new BinaryTreeNode();pNode->m_nValue = value;pNode->m_pLeft = NULL;pNode->m_pRight = NULL;return pNode;
}void ConnectTreeNodes(BinaryTreeNode* pParent, BinaryTreeNode* pLeft, BinaryTreeNode* pRight)
{if (pParent != NULL){pParent->m_pLeft = pLeft;pParent->m_pRight = pRight;}
}void PrintTreeNode(BinaryTreeNode* pNode)
{if (pNode != NULL){printf("value of this node is: %d\n", pNode->m_nValue);if (pNode->m_pLeft != NULL)printf("value of its left child is: %d.\n", pNode->m_pLeft->m_nValue);elseprintf("left child is null.\n");if (pNode->m_pRight != NULL)printf("value of its right child is: %d.\n", pNode->m_pRight->m_nValue);elseprintf("right child is null.\n");}else{printf("this node is null.\n");}printf("\n");
}void PrintTree(BinaryTreeNode* pRoot)
{PrintTreeNode(pRoot); if (pRoot != NULL){if (pRoot->m_pLeft != NULL)PrintTree(pRoot->m_pLeft);if (pRoot->m_pRight != NULL)PrintTree(pRoot->m_pRight);}
}void DestroyTree(BinaryTreeNode* pRoot)
{if (pRoot != NULL){BinaryTreeNode* pLeft = pRoot->m_pLeft;BinaryTreeNode* pRight = pRoot->m_pRight;delete pRoot;pRoot = NULL;DestroyTree(pLeft);DestroyTree(pRight);}
}

#ifndef LISTNODE_H_
#define LISTNODE_H_
#include<iostream>
#include<vector>;
using namespace std;
struct node
{int data;node *next;
};
node *CreateNode(int a[], int n);
void DisplayNode(node *head);
int ListLength(node*head);
void DeleteNode(node *head);
node *nth_node(node *head,int len);#endif#include"ListNode.h"
node *CreateNode(int a[], int n)
{if (n <= 0) return NULL;node *head = new node();head->data = a[0];node *p = head;for (int i = 1; i < n; i++){node *q = new node();q->data = a[i];p->next = q;p = q;}p->next = NULL;return  head;
}
void DisplayNode(node *head)
{node *p = head;while (p){cout << p->data << " ";p = p->next;}cout << endl;
}
int ListLength(node *head)
{node *p = head;int length = 0;while (p){length++;p = p->next;}return  length;}
void DeleteNode(node *head)
{node *p = head;while (head){head = p->next;delete p;p = head;}
}
node *nth_node(node *head, int len)
{if (len <= 0 || len > ListLength(head))return NULL;node *p = head;for (int i = 1; i < len; i++){p = p->next;}return p;
}

#include "BinaryTree.h"
#include"ListNode.h"
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;//===由有序链表构建BST
BinaryTreeNode *ConSortListToBST(node *head, int len)
{if (len == 0)return NULL;if (len==1)return CreateBinaryTreeNode(head->data);node *temp = nth_node(head,len / 2 + 1);BinaryTreeNode *proot = CreateBinaryTreeNode(temp->data);proot->m_pLeft = ConSortListToBST(head, len / 2);proot->m_pRight = ConSortListToBST(nth_node(head, len / 2 + 2), (len-1)/2);return proot;
}
BinaryTreeNode *ConSortListToBST(node *head)
{int length = ListLength(head);return ConSortListToBST(head, length);
}int main()
{const int n = 6;int a[n] = { 1, 3, 5, 7, 9, 11};node *head = CreateNode(a, n);BinaryTreeNode *proot = ConSortListToBST(head);//===PrintTree(proot);//===DestroyTree(proot);DeleteNode(head);
}

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

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. ...
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 ...
Convert Sorted Array to Binary Search Tree - LeetCode
目录题目链接注意点解法小结题目链接 Convert Sorted Array to Binary Search Tree - LeetCode 注意点不要访问空结点题目要求的是平衡二叉搜 ...
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 ...
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】109. Convert Sorted List to Binary Search Tree
题目如下: Given a singly linked list where elements are sorted in ascending order, convert it to a heigh ...
【链表递归构造二叉树】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 ...
Convert Sorted List to Binary Search Tree ------C++ 递归创建平衡二叉查找树
有序链表 0->1->2->3->4->5 转换为一个二叉排序树.我们在此创建一个平衡二叉排序树 1.先找链表到中间的节点 2.中间节点的val创建一个新的树节点Tree ...

5.3.5—二叉查找树—Convert Sorted List to Binary Sear Tree

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

最新文章

热门文章