Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define right(node) &((*node)->right)
- #define left(node) &((*node)->left)
- #define value(node) (*n)->value
- void tree_insert(node** node, int value){
- if (*node == NULL){
- *node = node_new(value);
- tree_insert(value > value(node) ? right(node) : left(node), value);
- }
Add Comment
Please, Sign In to add comment