c_notes_struct_pointer_2

c_notes_struct_pointers2.c

// a binary search tree can be implemented using structs with
// pointers to other structs as members.

struct bin_tree_node
{
    int value;
    struct bin_tree_node *left_child, *right_child;

};

struct tree_node node1, node2, node3, node4;

node1.value = 10;
node2.value = 5;
node3.value = 15;
node4.value = 12

node1.left_child = &node2;
node1.right_child = &node3;
node3.left_child = &node4;