Inorder lnr

preorder

postorder

1. delete root; ==⇒ delete keyword;
2. int arr[100];
3. int *arr = int[100];
4. template <typename T>

<aside> ✏️ hashmap

hashmap

Trie

Graph

cycle detection in undirected graph

</aside>

graph

love babbar:

• basics and arrays

arrays

• binary search
• pair and vectors
• sort
• pointers
• recursion
• maps&sets
• oops

linked list

• stack

queues

• binary trees

binary search tree

heaps

hashmaps

• graph

• dynamic programming

• sql

• cpp interview questions

• other

• dijkstra

• union-find