Pooja's Tech Central
In continuation of my previous blog, Brushing up C, data structures, we’ll be taking up Binary Trees .
11 hours, 9 minutes ago
In my previous blog brushing up C part 4 , we discussed common uses of pointers. We’ll be taking up a few data structures in this blog. 648 more words
3 days, 8 hours ago
Pam Leetcode Note
If we want to delete the given node directly, we need to know the previous node. Obviously, we cannot get such information. Thus we copy the value of the next node to the current node and delete the next node. 34 more words
5 days, 18 hours ago
1 week ago
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.
* Definition for singly-linked list. 114 more words
2 weeks, 4 days ago
Input: A linked list of integer values
Output: A balanced binary search tree (BST) in O(n) time.
2 weeks, 5 days ago
For my tech interviews
Find the kth to last element of a singly linked list.
2 weeks, 6 days ago