二叉搜索树的实现-CSDN博客

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

本文介绍了一种二叉搜索树的数据结构，并提供了插入节点的实现方法及中序遍历来展示树中元素的顺序。通过具体的代码示例，演示了如何构建一棵二叉搜索树并打印其元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#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;