dsa_hkc_docs/bst_8h_source.html

#ifndef BST_H

#define BST_H


#include <stdbool.h>


typedef struct treenode {

    int value;

    struct treenode *left;

    struct treenode *right;

} treenode;


treenode *createnode(int value);


void printtree(treenode *root);


bool tree_insertnumber(treenode **rootptr, int value);


bool tree_findnumber(treenode *root, int value);


#endif // BST_H

createnode
treenode * createnode(int value)
Creates a new tree node.
Definition bst.c:6

printtree
void printtree(treenode *root)
Prints the tree in a structured format.
Definition bst.c:45

tree_findnumber
bool tree_findnumber(treenode *root, int value)
Searches for a value in the binary search tree.
Definition bst.c:63

tree_insertnumber
bool tree_insertnumber(treenode **rootptr, int value)
Inserts a number into the binary search tree.
Definition bst.c:47

treenode
A node in the binary search tree.
Definition bst.h:22

treenode::right
struct treenode * right
Pointer to right child.
Definition bst.h:25

treenode::value
int value
Value stored in this node.
Definition bst.h:23

treenode::left
struct treenode * left
Pointer to left child.
Definition bst.h:24