Skip to content
/ Data-Structures Public

I created this repo for students and beginners who are new in programming, you can contribute new programs here. I practiced these codes during my class hours and home...

2 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

navjotsinghprince/Data-Structures

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
1.1Structures.c
1.1Structures.c
 
 
1.2Pointers.c
1.2Pointers.c
 
 
1.3Dynamic_Memory_Allocation_Info.c
1.3Dynamic_Memory_Allocation_Info.c
 
 
1.4malloc.c
1.4malloc.c
 
 
1.5calloc.c
1.5calloc.c
 
 
1.6realloc.c
1.6realloc.c
 
 
1.7Data_Structure_info.c
1.7Data_Structure_info.c
 
 
1.8Algorithm_info.c
1.8Algorithm_info.c
 
 
1.9Array_info.c
1.9Array_info.c
 
 
10Recursion_Backtracking_info.c
10Recursion_Backtracking_info.c
 
 
11Sum_Of_First_N_Numbers.c
11Sum_Of_First_N_Numbers.c
 
 
12Addition_Using_Pointer.c
12Addition_Using_Pointer.c
 
 
13Factorial_Recursion.c
13Factorial_Recursion.c
 
 
14Fibonacci_Series.c
14Fibonacci_Series.c
 
 
15Greatest_Common-Divisor.c
15Greatest_Common-Divisor.c
 
 
16Stack_Depth_info.c
16Stack_Depth_info.c
 
 
17Stack_Dynamic_Array.c
17Stack_Dynamic_Array.c
 
 
18Linked_List_Info.c
18Linked_List_Info.c
 
 
19Linked_List_Program.c
19Linked_List_Program.c
 
 
20Doubly_linked_list_Program.c
20Doubly_linked_list_Program.c
 
 
21Polish_Notation_Info.c
21Polish_Notation_Info.c
 
 
22Queue.c
22Queue.c
 
 
23Tree_info.c
23Tree_info.c
 
 
24Binary_Tree_Info.c
24Binary_Tree_Info.c
 
 
25_Traversing_Binary_Tree_Info.c
25_Traversing_Binary_Tree_Info.c
 
 
26Binary_Search_Tree_info.c
26Binary_Search_Tree_info.c
 
 
27Find_Method_BST_info.c
27Find_Method_BST_info.c
 
 
28Insert_Data_Method_info.c
28Insert_Data_Method_info.c
 
 
29Deletion_Method_BST_info.c
29Deletion_Method_BST_info.c
 
 
30AVL_Tree_info.c
30AVL_Tree_info.c
 
 
31Heap_info.c
31Heap_info.c
 
 
32Linear_Search_Technique.c
32Linear_Search_Technique.c
 
 
33Binary_Search.c
33Binary_Search.c
 
 
34Hash_Table_info.c
34Hash_Table_info.c
 
 
35Sorting_Info.c
35Sorting_Info.c
 
 
36Bubble_Sort_info.c
36Bubble_Sort_info.c
 
 
37BubbleSort.c
37BubbleSort.c
 
 
38Modified_Bubble_Sort.c
38Modified_Bubble_Sort.c
 
 
39Selection_Sort_info.c
39Selection_Sort_info.c
 
 
40Selection_Sort.c
40Selection_Sort.c
 
 
41Insertion_Sort.c
41Insertion_Sort.c
 
 
42Graph_Info.c
42Graph_Info.c
 
 
43Graph_Traversal_info.c
43Graph_Traversal_info.c
 
 
44Breadth_First_Search_info.c
44Breadth_First_Search_info.c
 
 
45Depth_First_Search_info.c
45Depth_First_Search_info.c
 
 
46Minimal_Spanning_Tree_info.c
46Minimal_Spanning_Tree_info.c
 
 
Almost_Complete_Binary_Tree.pptx
Almost_Complete_Binary_Tree.pptx
 
 
BFS.png
BFS.png
 
 
Binary_Search_Tree.pptx
Binary_Search_Tree.pptx
 
 
Complete_Binary_Tree.pptx
Complete_Binary_Tree.pptx
 
 
Complete_Graph.png
Complete_Graph.png
 
 
Connected_Graph.png
Connected_Graph.png
 
 
DFS.png
DFS.png
 
 
Direct_Direction_Graph.png
Direct_Direction_Graph.png
 
 
Extended_Binary_Tree.pptx
Extended_Binary_Tree.pptx
 
 
Graph_Basic.png
Graph_Basic.png
 
 
Heap.pptx
Heap.pptx
 
 
Inorder_Traversel.pptx
Inorder_Traversel.pptx
 
 
LevelOrderBinaryTree.pptx
LevelOrderBinaryTree.pptx
 
 
LevelOrder_Traversel.pptx
LevelOrder_Traversel.pptx
 
 
Multiple_edges_Graph.png
Multiple_edges_Graph.png
 
 
PostOrder_Traversel.pptx
PostOrder_Traversel.pptx
 
 
PreOrder_Traversel.pptx
PreOrder_Traversel.pptx
 
 
README.md
README.md
 
 
Strict_Complete_Binary_Tree .pptx
Strict_Complete_Binary_Tree .pptx
 
 
Sub_Graph.png
Sub_Graph.png
 
 
Tree_Diagram_Representation.pptx
Tree_Diagram_Representation.pptx
 
 
Tree_Graph.png
Tree_Graph.png
 
 
Tree_Nodes_Representation.pptx
Tree_Nodes_Representation.pptx
 
 
calculation memory requird array.png
calculation memory requird array.png
 
 
calculation memory required array.png
calculation memory required array.png
 
 
dynamic_stack_array.png
dynamic_stack_array.png
 
 
stack_diagram.png
stack_diagram.png
 
 

Repository files navigation

C-PROGRAMMING-DATA-STRUCTURES

Students and beginners who are new in programming, you can contribute new programs here. I practiced these codes during my class hours and home...

Authors

👉 Navjot Singh Prince

See also the site of contributor who participated in this study material.

Contact

If you discover any question within study material, please send an e-mail to Prince Ferozepuria via fzr@navjotsinghprince.com. Your all questions will be answered.

Buy Me A Coffee! ☕

Feel free to buy me a coffee at Buy me a coffee! ☕, I would be really grateful for anything, be it coffee or just a kind comment towards my work, that helps me a lot.

Donation

The study material is completely free to use, however, it has taken a lot of time to build. If you would like to show your appreciation by leaving a small donation, you can do so by clicking here here. Thanks!

About

I created this repo for students and beginners who are new in programming, you can contribute new programs here. I practiced these codes during my class hours and home...

Topics

c tree linked-list stack queue algorithms cpp graph recursion data-structures binary-search-tree sorting-algorithms heap hashtable polish-notation pointers hashtables algorithms-and-data-structures pointers-and-arrays dynamic-memory-allocation

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •  

Languages