1 + # 🔍 Search Insert Position 2 + 3 + **LeetCode Link**: [Problem #35] ( https://leetcode.com/problems/search-insert-position/ ) 4 + **Difficulty**: Easy 5 + **Category**: Binary Search 6 + **Status**: ✅ Solved ...
Logic -> 1st method is convert LL to array and then sort that array and then take mid point and make that as treenode and then use recursion for start to mid-1 and mid+1 to end for right and left part of BST 2method is make helper and pass head and tail as null, then find ...