#### Data Structures: Doubly-Linked List Big O

A doubly-linked list is a linked list in which each node has a pointer to the next node and the previous node.  Lists such as these usually have both a head and tail pointer which, naturally, points to the first and last node inside the list.   125 more words

Tutorials

#### I'm Doubling Down on a Mistake

Let me double down on a mistake. Two days ago, I wrote that Python lists are not lists, they’re arrays.

I got called out  488 more words

Misc

#### New Report Finds Some People Are Still Sociable

WASHINGTON—In a groundbreaking, super duper important report experts say fundamentally rewrites our understanding of humans, new data published last week by the Intergovernmental Panel on Social Interactions has found that some people are still socializing face to face. 322 more words

#### Merge two sorted linked list

```Node* mergeSortedList(Node* head1, Node* head2)
{
Node* h;

{
}
else
{
}

return h;
}```
Recursion

#### Remove duplicates from linked list

```void removeDuplicate(Node* root)
{
unordered_map<int, bool> hashTable;
Node* prev = NULL;

while(root)
{
int data = root->data;
if(hashTable.find(data) == hashTable.end())
{
//mark the data as found
hashTable = true;
//mark the last position of unique list
prev = root;
}
else
{
//then skip it
prev->next = root->next;
}
//iterate each node
root = root->next;
}
}```

#### Day 1, Week 1, Session 1

Algorithms & Data Structures

Highlights

• Reverse a linked list (iterative & recursive)
• k-th node from the last…
• 68 more words

#### Applications of Data Structures ( Part 1 )

STACK:

• Processing procedure calls and their termination.
• Recursive call of a procedure.
• Compilers: Parsing techniques( LL(1) parser ; Shift-Reduce parser ).
• TOC(Theory of Computation): Implementation of Context-Free-Language(CFL) in form of Push-Down Automata.
• 565 more words
Technical