Thanks to visit codestin.com
Credit goes to github.com

Skip to content
/ DATA_STRUCTURES Public

This repo includes programs related to data structures viz(Heap,Binary search trees, Balances BST, Dynamic programming,linkelist,stack ,queue and graph)

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

shvmshukla/DATA_STRUCTURES

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

98 Commits
AVL_deletion.c
AVL_deletion.c
 
 
AVL_insertion.c
AVL_insertion.c
 
 
Applications_of_balanced_binary_trees.c
Applications_of_balanced_binary_trees.c
 
 
BST_elements_in_given_range_printing.cpp
BST_elements_in_given_range_printing.cpp
 
 
Delete_N_nodes_after_M_nodes_of_a_linked_list.cpp
Delete_N_nodes_after_M_nodes_of_a_linked_list.cpp
 
 
Delete_middle_element_of_a_stack.java
Delete_middle_element_of_a_stack.java
 
 
Delete_nodes_greater_than_k_in_BST.cpp
Delete_nodes_greater_than_k_in_BST.cpp
 
 
Delete_nodes_having_greater_value_on _right(AMAZON).cpp
Delete_nodes_having_greater_value_on _right(AMAZON).cpp
 
 
Delete_without_head_pointer.cpp
Delete_without_head_pointer.cpp
 
 
Deletion_node_with_a_particular_key_in_a_circular_Linked_List.cpp
Deletion_node_with_a_particular_key_in_a_circular_Linked_List.cpp
 
 
Depth_first_traversal_by_coloring_and_inefficient_DFS.c
Depth_first_traversal_by_coloring_and_inefficient_DFS.c
 
 
FUnction_to_add_two_numbers_represented_by_link_list.cpp
FUnction_to_add_two_numbers_represented_by_link_list.cpp
 
 
Graph.java (topological_sort)
Graph.java (topological_sort)
 
 
Graph_creation_by_adjacency_list.c
Graph_creation_by_adjacency_list.c
 
 
Heap_sort.java
Heap_sort.java
 
 
Identical_trees_check.cpp
Identical_trees_check.cpp
 
 
InfixToPostfix.cpp
InfixToPostfix.cpp
 
 
Insert_in_Middle_of_Linked_List.cpp
Insert_in_Middle_of_Linked_List.cpp
 
 
Intersection_Point_in_Y_Shapped_Linked_Lists.cpp
Intersection_Point_in_Y_Shapped_Linked_Lists.cpp
 
 
K_distance_from_root.cpp
K_distance_from_root.cpp
 
 
Linked_List.java
Linked_List.java
 
 
Maximum_path_sum_from_one_leaf_to_another.cpp
Maximum_path_sum_from_one_leaf_to_another.cpp
 
 
Merge_two_sorted_linked_lists.cpp
Merge_two_sorted_linked_lists.cpp
 
 
Next_Greater_Element(StackApplication_very_tricky).java
Next_Greater_Element(StackApplication_very_tricky).java
 
 
Print_the_bottom_view_of_binary_tree.java
Print_the_bottom_view_of_binary_tree.java
 
 
README.md
README.md
 
 
Rearrange_a_linked_list(AMAZON).cpp
Rearrange_a_linked_list(AMAZON).cpp
 
 
Reverse_a_LinkedList_in_groups_of_given_size.cpp
Reverse_a_LinkedList_in_groups_of_given_size.cpp
 
 
Reverse_a_stack_using_recursion.java
Reverse_a_stack_using_recursion.java
 
 
SORTING_bubble_sort.java
SORTING_bubble_sort.java
 
 
SORTING_counting_sort.java
SORTING_counting_sort.java
 
 
SORTING_insertion_sort.java
SORTING_insertion_sort.java
 
 
SORTING_radix_sort.java
SORTING_radix_sort.java
 
 
SORTING_selection_sort.java
SORTING_selection_sort.java
 
 
SORTING_shell_sort.java
SORTING_shell_sort.java
 
 
_function_for_height_of_a_binary_tree.cpp
_function_for_height_of_a_binary_tree.cpp
 
 
atleast_bell.c
atleast_bell.c
 
 
atmost_bell.c
atmost_bell.c
 
 
bellman_ford.java
bellman_ford.java
 
 
bellmanford_exactly.java
bellmanford_exactly.java
 
 
binary_tree_to_its_mirror_tree_conversion.cpp
binary_tree_to_its_mirror_tree_conversion.cpp
 
 
bottom_view_of_a_binary_tree.java
bottom_view_of_a_binary_tree.java
 
 
breadth_first_traversal.java
breadth_first_traversal.java
 
 
check_whether_give_binary_tree_is_BST_or_not.cpp
check_whether_give_binary_tree_is_BST_or_not.cpp
 
 
check_whether_given_tree_is_balanced_or_not.cpp
check_whether_given_tree_is_balanced_or_not.cpp
 
 
check_whether_tree_is_symmentric_or_not.cpp
check_whether_tree_is_symmentric_or_not.cpp
 
 
count_no_of_leaves_in_a_binary_tree.cpp
count_no_of_leaves_in_a_binary_tree.cpp
 
 
count_possible_paths_top_left_bottom_right_nxm_matrix.java
count_possible_paths_top_left_bottom_right_nxm_matrix.java
 
 
depthFirstTraversal.java
depthFirstTraversal.java
 
 
detect_loop_in_linklist.cpp
detect_loop_in_linklist.cpp
 
 
detect_whether_two_trees_are_identical.cpp
detect_whether_two_trees_are_identical.cpp
 
 
diameter_of_binary_tree.cpp
diameter_of_binary_tree.cpp
 
 
exactly_bell.c
exactly_bell.c
 
 
find_first_non_repeating_character_stream_characters.java
find_first_non_repeating_character_stream_characters.java
 
 
find_length_of_loop_in_linked_list.cpp
find_length_of_loop_in_linked_list.cpp
 
 
find_median_in_a_stream(heap_application).java
find_median_in_a_stream(heap_application).java
 
 
fractional_kanpsack.java
fractional_kanpsack.java
 
 
function_to_count_the_no_of_leaves.cpp
function_to_count_the_no_of_leaves.cpp
 
 
get_middle_element_of_linklist.cpp
get_middle_element_of_linklist.cpp
 
 
has_path_sum_equal_to_a_value.cpp
has_path_sum_equal_to_a_value.cpp
 
 
isomorphism_of_two_trees_checking
isomorphism_of_two_trees_checking
 
 
kth_largest_element_in_a_stream(Heap_application).java
kth_largest_element_in_a_stream(Heap_application).java
 
 
linklist_is_pallindrome.java
linklist_is_pallindrome.java
 
 
longest_common_subsequence.cpp
longest_common_subsequence.cpp
 
 
longest_common_subsequence_space_efficicient.java
longest_common_subsequence_space_efficicient.java
 
 
longest_pallindromic_sequence.java
longest_pallindromic_sequence.java
 
 
longest_pallindromic_subsequence_efficient.java
longest_pallindromic_subsequence_efficient.java
 
 
longest_pallindromic_substring.java
longest_pallindromic_substring.java
 
 
lowest_common_ancestor.cpp
lowest_common_ancestor.cpp
 
 
merge_k_sorted_arrays(heap_application).java
merge_k_sorted_arrays(heap_application).java
 
 
minimum_cost_path.java
minimum_cost_path.java
 
 
minimum_depth_of_binary_tree.cpp
minimum_depth_of_binary_tree.cpp
 
 
minimum_jumps_to_reach_end.java
minimum_jumps_to_reach_end.java
 
 
print_left_view_of_binary_tree.cpp
print_left_view_of_binary_tree.cpp
 
 
queue_using_two_stacks.java
queue_using_two_stacks.java
 
 
reverse_a_linklist.cpp
reverse_a_linklist.cpp
 
 
rod_cutting_dp.java
rod_cutting_dp.java
 
 
root_to_leaf_paths_sum.cpp
root_to_leaf_paths_sum.cpp
 
 
sorting_an_stack_(inplace_sorting).java
sorting_an_stack_(inplace_sorting).java
 
 
stack_using_two_queues.java
stack_using_two_queues.java
 
 
staircase_problem(fibonacci)_DP.java
staircase_problem(fibonacci)_DP.java
 
 
ternary_expression_to_binary_tree.cpp
ternary_expression_to_binary_tree.cpp
 
 
to_check_whether_link_list_is_pallindrome.cpp
to_check_whether_link_list_is_pallindrome.cpp
 
 
undertest.cpp
undertest.cpp
 
 
zero_one_knapsack_DP.java
zero_one_knapsack_DP.java
 
 
zero_one_knapsack_space_efficient.java
zero_one_knapsack_space_efficient.java
 
 

Repository files navigation

DATA_STRUCTURES

this repo includes programs related to data structure and are coded in C or C++

About

This repo includes programs related to data structures viz(Heap,Binary search trees, Balances BST, Dynamic programming,linkelist,stack ,queue and graph)

Topics

linked-list stack queue data-structures binary-tree heap bst trees

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages