What it does
In binary search tree, the left node has a value less than its parent node and right node has a greater value than its parent node
How we built it
Using recursion, we build the tree
Built With
- c
- recursion
Implementation
In binary search tree, the left node has a value less than its parent node and right node has a greater value than its parent node
Using recursion, we build the tree
Log in or sign up for Devpost to join the conversation.