Data-Structure-Algorithm-in-CPP

Here's my repositary of all Data Structure and Algorithm.. I've learnt this from Apna College by Aman Dhatarwal and Code Help by Love Babbar Playlist.

Name		Name	Last commit message	Last commit date
Latest commit History 12 Commits
BST_to_minHeap_Heap.cpp		BST_to_minHeap_Heap.cpp
BT_to_BST.cpp		BT_to_BST.cpp
Deque_&_sliding_window_max.cpp		Deque_&_sliding_window_max.cpp
Deque_and_sliding_window_max.cpp		Deque_and_sliding_window_max.cpp
Kth_largest_BST.cpp		Kth_largest_BST.cpp
Kth_lowest_BST.cpp		Kth_lowest_BST.cpp
LCA_BST.cpp		LCA_BST.cpp
Queue_ab.cpp		Queue_ab.cpp
Queue_ap.cpp		Queue_ap.cpp
Queue_using_stack_ap.cpp		Queue_using_stack_ap.cpp
README.md		README.md
Recursion_ap.cpp		Recursion_ap.cpp
STL_ab.cpp		STL_ab.cpp
Stack_using_queue.cpp		Stack_using_queue.cpp
Trapping_Rain_Water.cpp		Trapping_Rain_Water.cpp
activity_selection_greedy.cpp		activity_selection_greedy.cpp
add_2_numbers_representedBy_LL.cpp		add_2_numbers_representedBy_LL.cpp
array_challenges.cpp		array_challenges.cpp
array_demo.cpp		array_demo.cpp
array_ques_ap.cpp		array_ques_ap.cpp
binary_search_ap.cpp		binary_search_ap.cpp
binary_tree.cpp		binary_tree.cpp
binary_tree_order_level_traversal_and_sum.cpp		binary_tree_order_level_traversal_and_sum.cpp
binary_tree_traversal.cpp		binary_tree_traversal.cpp
boundary_traversal_BT.cpp		boundary_traversal_BT.cpp
bubble_sort_ab.cpp		bubble_sort_ab.cpp
bubble_sort_ap.cpp		bubble_sort_ap.cpp
buildTree_postorder_inorder_BT.cpp		buildTree_postorder_inorder_BT.cpp
build_tree_using_indorder_and_preorder.cpp		build_tree_using_indorder_and_preorder.cpp
build_tree_using_indorder_and_preorder_gfg.cpp		build_tree_using_indorder_and_preorder_gfg.cpp
build_tree_using_inorder_and_postorder.cpp		build_tree_using_inorder_and_postorder.cpp
buy_candies_greedy.cpp		buy_candies_greedy.cpp
checkPalindrome_LL.cpp		checkPalindrome_LL.cpp
choclate_distribution_greedy.cpp		choclate_distribution_greedy.cpp
circular_linkedList.cpp		circular_linkedList.cpp
count_and_sum_of_Nodes_BT.cpp		count_and_sum_of_Nodes_BT.cpp
count_and_sum_of_nodes.cpp		count_and_sum_of_nodes.cpp
count_number_of_nodes_inLoop_LL.cpp		count_number_of_nodes_inLoop_LL.cpp
count_pairs_with_given_sum.cpp		count_pairs_with_given_sum.cpp
daa_prac1.cpp		daa_prac1.cpp
daa_prac2.cpp		daa_prac2.cpp
daa_prac4.cpp		daa_prac4.cpp
daa_prac5.cpp		daa_prac5.cpp
daa_prac6.cpp		daa_prac6.cpp
detection_and_removal_of_cycle_ll.cpp		detection_and_removal_of_cycle_ll.cpp
distBtw_2_nodes_BT.cpp		distBtw_2_nodes_BT.cpp
dnf_sort.cpp		dnf_sort.cpp
double_ll_ap.cpp		double_ll_ap.cpp
doubly_linkedList.cpp		doubly_linkedList.cpp
evenAfterOdd_linkedList.cpp		evenAfterOdd_linkedList.cpp
flatten_BT_in_LL.cpp		flatten_BT_in_LL.cpp
flatten_LL.cpp		flatten_LL.cpp
function_challenge_ap.cpp		function_challenge_ap.cpp
function_placement_question.cpp		function_placement_question.cpp
hasing_intro.cpp		hasing_intro.cpp
heap_intro.cpp		heap_intro.cpp
heightBalanced_BT.cpp		heightBalanced_BT.cpp
height_and_daimeter_BT.cpp		height_and_daimeter_BT.cpp
height_daimeter_of_tree.cpp		height_daimeter_of_tree.cpp
identical_BST.cpp		identical_BST.cpp
identical_BT.cpp		identical_BT.cpp
indian_coin_change_Greedy.cpp		indian_coin_change_Greedy.cpp
infix_to_postfix.cpp		infix_to_postfix.cpp
infix_to_prefix.cpp		infix_to_prefix.cpp
insertion_sort_ab.cpp		insertion_sort_ab.cpp
insertion_sort_ap.cpp		insertion_sort_ap.cpp
intersection_2_ll.cpp		intersection_2_ll.cpp
kth_Largest_subArray_Heap.cpp		kth_Largest_subArray_Heap.cpp
largest_BST_in_BT_BST.cpp		largest_BST_in_BT_BST.cpp
largest_area_in_histogram.cpp		largest_area_in_histogram.cpp
leftView_BT.cpp		leftView_BT.cpp
levelOrderTraversal_BT.cpp		levelOrderTraversal_BT.cpp
linear_search_ap.cpp		linear_search_ap.cpp
linkedList.cpp		linkedList.cpp
linked_list_ap.cpp		linked_list_ap.cpp
lowestCommonAncestor_BT.cpp		lowestCommonAncestor_BT.cpp
maps_intro.cpp		maps_intro.cpp
matrix_ab.cpp		matrix_ab.cpp
maxSum_greedy.cpp		maxSum_greedy.cpp
maximum_toys_greedy.cpp		maximum_toys_greedy.cpp
mergeSort_LL.cpp		mergeSort_LL.cpp
merge_2BST_BST.cpp		merge_2BST_BST.cpp
merge_2_linkedList.cpp		merge_2_linkedList.cpp
merge_2_maxHeap_Heap.cpp		merge_2_maxHeap_Heap.cpp
merge_Ksorted_Arrays_Heaps.cpp		merge_Ksorted_Arrays_Heaps.cpp
merge_Ksorted_linkedList_Heaps.cpp		merge_Ksorted_linkedList_Heaps.cpp
merge_sort_ap.cpp		merge_sort_ap.cpp
middleELemnt_LL.cpp		middleELemnt_LL.cpp
minCost_ropes_Heap.cpp		minCost_ropes_Heap.cpp
mirrorTree_BT.cpp		mirrorTree_BT.cpp
next_smaller_element_Stack.cpp		next_smaller_element_Stack.cpp
p_4_Queue.cpp		p_4_Queue.cpp
pair.cpp		pair.cpp
postfix_evaluation_ap.cpp		postfix_evaluation_ap.cpp
prac1.cpp		prac1.cpp
prac2.cpp		prac2.cpp
prac3.cpp		prac3.cpp
prac4.cpp		prac4.cpp
prefix_evaluation_ap.cpp		prefix_evaluation_ap.cpp
quick_sort_ap.cpp		quick_sort_ap.cpp

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Data-Structure-Algorithm-in-CPP

About

Releases

Packages

Languages

harshturakhia/Data-Structure-Algorithm-in-CPP

Folders and files

Latest commit

History

Repository files navigation

Data-Structure-Algorithm-in-CPP

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages