#ifndef __ITERATIVE_TREE_TRAVERSALS_BST_H__
#define __ITERATIVE_TREE_TRAVERSALS_BST_H__
#pragma pack(1) // Tell gcc not to padding between struct fields, for clearer Valgrind metrics

// Struct type definitions
typedef struct _BSTNode {
    int value;                //  =4 bytes¹
    struct _BSTNode* left;    //  =8 bytes¹
    struct _BSTNode* right;   //  =8 bytes¹
} BSTNode;                    // =20 bytes¹

typedef struct _StackNode {
    BSTNode* value;
    struct _StackNode* next;
} StackNode;


// Function declarations
void stack_push(StackNode** a_top, BSTNode* value);
BSTNode* stack_pop(StackNode** a_top);
bool stack_is_empty(StackNode* top);
void insert(int value, BSTNode** a_root);
void destroy_tree(BSTNode** a_root);
void print_tree_in_order(BSTNode* root);
void print_tree_pre_order(BSTNode* root);

#endif /* end of include guard: __ITERATIVE_TREE_TRAVERSALS_BST_H__ */