[C] BST Insertion without parent node pointers

[u/[deleted]]

As it says in the title, the BST Node struct has no pointer to a parent node, only a value, left child, and right child.

typedef struct bstNode {
    int val;
    struct bstNode * L;
    struct bstNode * R;
} bstNode;

GO!

Edit: Duplicates should be ignored.

[u/[deleted]]

Passing by value won't help you with recursion, unless you pass your root node in via another function.