BST_Demo/_b_s_t_8h_source.html

#pragma once


#ifndef BST_H

#define BST_H


#include "Node.h"


class BST {

public:

    BST();


    ~BST();


    void insert(int value);


    bool search(int value) const;


    void inorder() const;


    void levelOrder() const;


    bool remove(int value);


private:

    Node* root;


    void destroyTree();

};


#endif // BST_H

Node.h
Declaration of the Node class.

BST::levelOrder
void levelOrder() const
Performs a level-order (breadth-first) traversal of the tree.
Definition BST.cpp:127

BST::inorder
void inorder() const
Performs an inorder traversal of the tree.
Definition BST.cpp:102

BST::insert
void insert(int value)
Inserts a value into the BST.
Definition BST.cpp:41

BST::BST
BST()
Constructs an empty BST.
Definition BST.cpp:26

BST::remove
bool remove(int value)
Removes a value from the BST if it exists.
Definition BST.cpp:154

BST::search
bool search(int value) const
Searches for a value in the BST.
Definition BST.cpp:81

BST::~BST
~BST()
Destroys the BST and frees all dynamically allocated nodes.
Definition BST.cpp:31

Node
Represents a node within a binary search tree.
Definition Node.h:35