Lowest Common Ancestor (BST)

Get Started - takeUforward

Let T be a tree with n positions. Define the lowest common ance... | Filo

Himanshi Sehgal on Instagram: "Must Revise these algorithms… ➊ Sorting Algorithms ⭐ Quick Sort ⭐ Merge Sort ⭐ Heap Sort ⭐ Bubble Sort ⭐ Insertion Sort ⭐ Selection Sort ➋ Searching Algorithms ⭐ Binary Search ⭐ Linear Search ➌ Dynamic Programming (DP) ⭐ Fibonacci Sequence ⭐ Knapsack Problem ⭐ Longest Common Subsequence ⭐ Longest Increasing Subsequence ⭐ Coin Change ⭐ Edit Distance ⭐ House Robber ⭐ Palindromic Substring ⭐ Partition Equal Subset Sum ➍ Greedy Algorithms ⭐ Activity Selection ⭐ Huffman

Satyam Jyottsana gargee on Instagram: "Here I’m sharing that will solve 90% of your problem in DSA Month 1: Arrays & Strings Arrays: Two pointers, sliding window, prefix sums, subarrays, sorting Strings: Hashing, palindrome, substring search, two pointers — Month 2: Linked Lists & Stacks/Queues Linked Lists: Fast & slow pointers, reversal, merge/intersection Stacks/Queues: Monotonic stack, min/max stack, queue simulation — Month 3: Trees BFS, DFS, recursion Binary Search Tree (BST) Tree diameter