Latest commit

History

Folders and files

Repository files navigation

BinaryTree

Some Binary Tree Programs purely designed and developed in c even queues stack , map , hash and more to support complicated programs

About

Some Binary Tree Programs purely designed and developed in c even queues stack , map , hash and more to support complicated programs

Navigation Menu

Latest commit

History

Folders and files

Repository files navigation

BinaryTree

About

Resources

Stars

Watchers

Forks

Releases

Packages

Used by

Contributors

Languages

Name		Name	Last commit message	Last commit date
Calculate_height_of_a_binary_tree_with_leaf_nodes_forming_a_circular_doubly_linked_list.cpp		Calculate_height_of_a_binary_tree_with_leaf_nodes_forming_a_circular_doubly_linked_list.cpp
Convert_a_Binary_Tree_to_BST_by_maintaining_its_original_structure.cpp		Convert_a_Binary_Tree_to_BST_by_maintaining_its_original_structure.cpp
Depth_first_search_-_inorder,preorder,postorder.cpp		Depth_first_search_-_inorder,preorder,postorder.cpp
Determine_if_given_Binary_Tree_is_a_BST_or_not.cpp		Determine_if_given_Binary_Tree_is_a_BST_or_not.cpp
Find_maximum_width_of_given_binary_tree.cpp		Find_maximum_width_of_given_binary_tree.cpp
Function_to_determine_if_two_given_binary_trees_can_be_transformed.cpp		Function_to_determine_if_two_given_binary_trees_can_be_transformed.cpp
Function_to_print_the_vertical_sum_of_given_binary_tree.cpp		Function_to_print_the_vertical_sum_of_given_binary_tree.cpp
Print_all_paths_from_root_to_leaf_nodes_in_given_binary_tree.cpp		Print_all_paths_from_root_to_leaf_nodes_in_given_binary_tree.cpp
README.md		README.md
ancestors_of_given_node_in_a_binary_tree.cpp		ancestors_of_given_node_in_a_binary_tree.cpp
binary_tree_insertion_to_level_the_order_.cpp		binary_tree_insertion_to_level_the_order_.cpp
bottom_View_Of_The_Tree_Recursively.cpp		bottom_View_Of_The_Tree_Recursively.cpp
c_program_to_get_parent_node_of_a_node_.cpp		c_program_to_get_parent_node_of_a_node_.cpp
check_Given_Tree_Is_A_CompleteBinary_Tree_Or_Not.cpp		check_Given_Tree_Is_A_CompleteBinary_Tree_Or_Not.cpp
check_If_Given_Two_Nodes_Are_Cousins_To_Each_Others.cpp		check_If_Given_Two_Nodes_Are_Cousins_To_Each_Others.cpp
check_if_given_binary_tree_is_height_balanced_or_not.cpp		check_if_given_binary_tree_is_height_balanced_or_not.cpp
compare_two_binary_tree_iteratively.cpp		compare_two_binary_tree_iteratively.cpp
compare_two_binary_tree_recursively.cpp		compare_two_binary_tree_recursively.cpp
convert_GivenBinary_Tree_to_its_mirror_.cpp		convert_GivenBinary_Tree_to_its_mirror_.cpp
convert_Given_Binary_Tree_Into_Sum_Tree.cpp		convert_Given_Binary_Tree_Into_Sum_Tree.cpp
convert_a_normal_binary_tree_to_Left-child__right-sibling_(LC-RS)_binary_tree.cpp		convert_a_normal_binary_tree_to_Left-child__right-sibling_(LC-RS)_binary_tree.cpp
convert_binary_tree_into_doubly_linked_list.cpp		convert_binary_tree_into_doubly_linked_list.cpp
delete_all_nodes_of_Binary_Tree_Iteratively.cpp		delete_all_nodes_of_Binary_Tree_Iteratively.cpp
delete_all_nodes_of_Binary_Tree_recursivekly.cpp		delete_all_nodes_of_Binary_Tree_recursivekly.cpp
deletion_in_binary_tree_by_adjusting_rightmost_node.cpp		deletion_in_binary_tree_by_adjusting_rightmost_node.cpp
determine_If_A_Given_Binary_Tree_Is_A_Sub_tree_Of_Another_Binary_Tree_Or_Not.cpp		determine_If_A_Given_Binary_Tree_Is_A_Sub_tree_Of_Another_Binary_Tree_Or_Not.cpp
diagonal_sum_of_a_binary_tree.cpp		diagonal_sum_of_a_binary_tree.cpp
diagonal_traaversal_of_binary_tree.cpp		diagonal_traaversal_of_binary_tree.cpp
diameter_of_Binary_Tree.cpp		diameter_of_Binary_Tree.cpp
distance_between_two_nodes_of_binary_tree.cpp		distance_between_two_nodes_of_binary_tree.cpp
given_tree_is_a_SumTree.cpp		given_tree_is_a_SumTree.cpp
height_of_binary_tree_iteratively.cpp		height_of_binary_tree_iteratively.cpp
height_of_binary_tree_recursively.cpp		height_of_binary_tree_recursively.cpp
inorder_traversal_iteratively.cpp		inorder_traversal_iteratively.cpp
is_a_Binary_Tree_Symmetrical_.cpp		is_a_Binary_Tree_Symmetrical_.cpp
left_view_of_the_binary_tree_recursively_and_iteratively.cpp		left_view_of_the_binary_tree_recursively_and_iteratively.cpp
level_Order_Traversal_Iteratively_Reversed.cpp		level_Order_Traversal_Iteratively_Reversed.cpp
level_order_spiral_traversal_or_breadth_first_search_spiral.cpp		level_order_spiral_traversal_or_breadth_first_search_spiral.cpp
level_order_traversal_iteratively.cpp		level_order_traversal_iteratively.cpp
level_order_traversal_of_breadth_first_traversal_recursively.cpp		level_order_traversal_of_breadth_first_traversal_recursively.cpp
lowest_common_ancestor_.cpp		lowest_common_ancestor_.cpp
map_of_pair_and_key_with_basic_functionalities_impleted_by_linkedlist.cpp		map_of_pair_and_key_with_basic_functionalities_impleted_by_linkedlist.cpp
post_order_traversal_iteratively.cpp		post_order_traversal_iteratively.cpp
pre_order_traversal_iterativl=ely.cpp		pre_order_traversal_iterativl=ely.cpp
print_All_Cousins_Nodes_To_Each_Others.cpp		print_All_Cousins_Nodes_To_Each_Others.cpp
print_Next_Node_In_The_Same_Level.cpp		print_Next_Node_In_The_Same_Level.cpp
print_The_Path_OF_Max_Sum.cpp		print_The_Path_OF_Max_Sum.cpp
print_corner_nodes_of_binary_tree.cpp		print_corner_nodes_of_binary_tree.cpp
queue_of_tree_nodes_.cpp		queue_of_tree_nodes_.cpp
right_view_of_the_binary_tree_iteratively_and_recursively.cpp		right_view_of_the_binary_tree_iteratively_and_recursively.cpp
send_all_zero_nodes_to_bootom_of_the_binary_tree.cpp		send_all_zero_nodes_to_bootom_of_the_binary_tree.cpp
stack_of_tree_nodes_.cpp		stack_of_tree_nodes_.cpp
top_View_Of_The_Tree_Recursively.cpp		top_View_Of_The_Tree_Recursively.cpp
truncate_given_binary_tree_to_remove_nodes__which_lie_on_a_path_having_sum_less_than_k.cpp		truncate_given_binary_tree_to_remove_nodes__which_lie_on_a_path_having_sum_less_than_k.cpp
truncate_half_nodes_such_that_binary_tree_becomes_complete_binary_tree.cpp		truncate_half_nodes_such_that_binary_tree_becomes_complete_binary_tree.cpp
vertical_traversal_of_the_binary_tree.cpp		vertical_traversal_of_the_binary_tree.cpp