Binary Search Tree | 30 Days of Code in Python | Day 22

Hey, guys here we're with day 22 of #30daysofcode challenge, in this video, we talked about binary search tree AKA BST, and what is the difference between it and a linked list, and we solved the challenge of the day, by calling the method recursively

?Links & Resources
Challenge link: https://www.hackerrank.com/challenges/30-binary-search-trees
Create your first program course: http://bit.ly/create-your-first-program
---
❔ About The Channel:
#Whilelab is a Youtube channel that focuses on the software side of things here you will find videos explaining the software and top tips videos, and programming so that's why we also have programming tutorials and challenges to have fun from time to time, will also create some exciting projects whenever is possible.
---
⌚ The Current Uploading Schedule:
Two videos a week, on Sunday & Wednesday
---
Subscribe to the channel ? http://bit.ly/Subscribe-whilelab
---
? Playlists You May Like:
Top Tips: http://bit.ly/Top-Tips-Whilelab
Solving Hackerrank with Python: http://bit.ly/Hackerrank-Python-Whilelab
Speed coding: http://bit.ly/Speed-Coding-Whilelab
---
The Channel Social Media Accounts
Twitter :
? http://bit.ly/whilelab-twitter
Instagram :
? http://bit.ly/whilelab-instagram
---
If you've come this far, I would like to thank you for your time and wish you the best, and I hope you enjoy my content if you have any feedback or suggestion, then please let me know in the comments section.