C++ - Binary Search Tree Struct Definition
Here is binary search tree node definition is given below: All the nodes to left are less than the current node value and all nodes to the right are greater than the current node value. It would be true for each and every node in the binary search tree. Click here for validating binary search tree.
typedef struct _BSTNode
{
struct _BSTNode *left;
struct _BSTNode *right;
int data;
} BSTNode;
static BSTNode *root = NULL;
|
|