Process:
I learnt what binary search tree was, Further I had to understand what tree traversal was, I was able to know about Inorder, Preorder and Post order traversal Then, I tried to form a code and implement it!
I made a lot of mistakes while making the tree but in the end was able to come up with a working code!
Log in or sign up for Devpost to join the conversation.