微软100题-1

最新推荐文章于 2022-10-16 22:57:42 发布

yanjiahong01

最新推荐文章于 2022-10-16 22:57:42 发布

阅读量341

点赞数 1

本文链接：https://blog.csdn.net/yanjiahong01/article/details/12448069

版权

#include<iostream>
using namespace std;
struct BSTreeNode
{
int m_nValue;
BSTreeNode *m_pLeft;
BSTreeNode *m_pRight;
};
void addBSTreeNode(BSTreeNode * & pCurrent, int value)
{
    if (NULL == pCurrent)
    {
        BSTreeNode * pBSTree = new BSTreeNode();
        pBSTree->m_pLeft = NULL;
        pBSTree->m_pRight = NULL;
        pBSTree->m_nValue = value;
        pCurrent = pBSTree;

    }
    else
    {
        if ((pCurrent->m_nValue) > value)
        {
            addBSTreeNode(pCurrent->m_pLeft, value);
        }
        else if ((pCurrent->m_nValue) < value)
        {
            addBSTreeNode(pCurrent->m_pRight, value);
        }
        else
        {

        }
    }
}

void inorder(BSTreeNode *root)
{
if(root==NULL)
  return;
else
{
  inorder(root->m_pLeft);
  cout<<root->m_nValue<<endl;
  inorder(root->m_pRight);
}
}
int main()
{
BSTreeNode * pRoot = NULL;
    addBSTreeNode(pRoot, 10);
    addBSTreeNode(pRoot, 4);
    addBSTreeNode(pRoot, 6);
    addBSTreeNode(pRoot, 8);
    addBSTreeNode(pRoot, 12);
    addBSTreeNode(pRoot, 14);
    addBSTreeNode(pRoot, 16);
inorder(pRoot);
    return 0;