DSA-in-December

✨ DAY 20 - Binary Search Tree ✨

📌In Binary Search Tree, all nodes which are present to the left of root will be less than root node and nodes which are present to the right will be greater than the root node.

✏️ 𝗙𝗼𝗿 𝗯𝗲𝘁𝘁𝗲𝗿 𝘂𝗻𝗱𝗲𝗿𝘀𝘁𝗮𝗻𝗱𝗶𝗻𝗴 𝗿𝗲𝗳𝗲𝗿 𝗳𝗼𝗹𝗹𝗼𝘄𝗶𝗻𝗴 𝗮𝗿𝘁𝗶𝗰𝗹𝗲𝘀 ;

1. https://www.geeksforgeeks.org/binary-search-tree-data-structure/
2. https://www.javatpoint.com/binary-search-tree
3. https://www.programiz.com/dsa/binary-search-tree
4. https://www.javatpoint.com/java-program-to-construct-a-binary-search-tree-and-perform-deletion-and-in-order-traversal
5. https://www.softwaretestinghelp.com/binary-search-tree-in-java/

📽️ 𝗧𝘂𝘁𝗼𝗿𝗶𝗮𝗹 𝗟𝗶𝗻𝗸𝘀;

1. https://youtu.be/ScdwdSCnXDU
2. https://youtu.be/ScdwdSCnXDU
3. https://youtu.be/b8hE6t14NDs
4. https://youtu.be/sXABdGalFNg
5. https://youtu.be/OYqYEM1bMK8

👨‍💻 𝗤𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝗶𝗻𝗴 𝗥𝗼𝘂𝗻𝗱: 👇

1. https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
2. https://leetcode.com/problems/binary-tree-inorder-traversal/
3. https://leetcode.com/problems/binary-tree-postorder-traversal/
4. https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
5. https://leetcode.com/problems/find-mode-in-binary-search-tree/