Classes and Subpackages of problems.geeks.tree

problems.geeks.tree.Q001_Tree_Traversals
problems.geeks.tree.Q002_Calculate_Size_of_a_tree
problems.geeks.tree.Q003_Determine_if_Two_Trees_are_Identical
problems.geeks.tree.Q004_Find_the_Maximum_Depth_or_Height_of_a_Tree
problems.geeks.tree.Q005_Delete_a_Tree
problems.geeks.tree.Q006_Convert_a_Binary_Tree_into_its_Mirror_Tree
problems.geeks.tree.Q007_Print_out_all_of_its_root_to_leaf_paths_one_per_line
problems.geeks.tree.Q008A_Lowest_Common_Ancestor_in_a_Binary_Tree
problems.geeks.tree.Q008B_Lowest_Common_Ancestor_in_a_Binary_Search_Tree
problems.geeks.tree.Q009_The_Great_Tree_List_Recursion_Problem
problems.geeks.tree.Q010_Find_the_node_with_minimum_value_in_a_Binary_Search_Tree
problems.geeks.tree.Q011_Count_leaf_nodes_in_a_binary_tree
problems.geeks.tree.Q012_Check_if_a_binary_tree_is_BST_or_not
problems.geeks.tree.Q013_Level_order_traversal_in_spiral_form
problems.geeks.tree.Q014_Check_for_Children_Sum_Property_in_a_Binary_Tree
problems.geeks.tree.Q015_Convert_an_arbitrary_Binary_Tree_to_a_tree_that_holds_Children_Sum_Property
problems.geeks.tree.Q016_Diameter_of_a_Binary_Tree
problems.geeks.tree.Q017_Determine_if_a_binary_tree_is_height_balanced
problems.geeks.tree.Q018_Decide_if_tree2_is_a_subtree_of_tree1
problems.geeks.tree.Q019_Print_all_paths_which_sum_to_a_given_value
problems.geeks.tree.Q020_Root_to_leaf_path_sum_equal_to_a_given_number
problems.geeks.tree.Q021_Double_Tree
problems.geeks.tree.Q022_Maximum_width_of_a_binary_tree
problems.geeks.tree.Q023_Foldable_Binary_Trees
problems.geeks.tree.Q024_Print_nodes_at_k_distance_from_root
problems.geeks.tree.Q025_Sorted_order_printing_of_a_given_array_that_represents_a_BST
problems.geeks.tree.Q026_Inorder_Successor_in_Binary_Search_Tree
problems.geeks.tree.Q027A_Find_kth_smallest_element_in_BST
problems.geeks.tree.Q028_Get_Level_of_a_node_in_a_Binary_Tree
problems.geeks.tree.Q029_Print_Ancestors_of_a_given_node_in_Binary_Tree
problems.geeks.tree.Q030_Print_BST_keys_in_the_given_range
problems.geeks.tree.Q031_Tournament_Tree_Winner_Tree_and_Binary_Heap
problems.geeks.tree.Q032_Check_if_a_given_Binary_Tree_is_SumTree
problems.geeks.tree.Q033_Connect_nodes_at_same_level
problems.geeks.tree.Q033_Connect_nodes_at_same_level$TreeNode
problems.geeks.tree.Q034_Sorted_Array_to_Balanced_BST
problems.geeks.tree.Q035_Populate_Inorder_Successor_for_all_nodes
problems.geeks.tree.Q035_Populate_Inorder_Successor_for_all_nodes$TreeNode
problems.geeks.tree.Q036_Convert_a_given_tree_to_its_Sum_Tree
problems.geeks.tree.Q037_Find_the_largest_BST_subtree_in_a_given_Binary_Tree
problems.geeks.tree.Q038_AVL_Tree_Insertion
problems.geeks.tree.Q039_AVL_Tree_Deletion
problems.geeks.tree.Q040_Vertical_Sum_in_a_given_Binary_Tree
problems.geeks.tree.Q041A_Merge_Two_Balanced_Binary_Search_Trees
problems.geeks.tree.Q041B_Merge_two_BSTs_with_limited_extra_space
problems.geeks.tree.Q042_Find_the_maximum_sum_leaf_to_root_path_in_a_Binary_Tree
problems.geeks.tree.Q043_Binary_Tree_to_Binary_Search_Tree_Conversion
problems.geeks.tree.Q044_Construct_Special_Binary_Tree_from_given_Inorder_traversal
problems.geeks.tree.Q045_Check_if_each_internal_node_of_a_BST_has_exactly_one_child
problems.geeks.tree.Q046_Check_whether_a_given_Binary_Tree_is_Complete_or_not
problems.geeks.tree.Q047_Boundary_Traversal_of_binary_tree
problems.geeks.tree.Q048_Two_nodes_of_a_BST_are_swapped_correct_the_BST
problems.geeks.tree.Q049A_Construct_Full_Binary_Tree_from_given_preorder_and_postorder_traversals
problems.geeks.tree.Q049B_Construct_BST_from_given_preorder_traversal
problems.geeks.tree.Q049C_Construct_BST_from_given_preorder_traversal
problems.geeks.tree.Q050_Floor_and_Ceil_from_a_BST
problems.geeks.tree.Q051_Convert_a_BST_to_a_Binary_Tree_such_that_sum_of_all_greater_keys_is_added_to_every_key
problems.geeks.tree.Q052A_Morris_traversal_for_Preorder
problems.geeks.tree.Q052B_Morris_traversal_for_Inorder
problems.geeks.tree.Q053_Largest_Independent_Set_Problem
problems.geeks.tree.Q054_Find_if_there_is_a_triplet_in_a_Balanced_BST_that_adds_to_zero
problems.geeks.tree.Q055_Find_a_pair_with_given_sum_in_a_Balanced_BST
problems.geeks.tree.Q056_Reverse_Level_Order_Traversal
problems.geeks.tree.Q057_Remove_BST_keys_outside_the_given_range
problems.geeks.tree.Q058_Tree_Isomorphism_Problem
problems.geeks.tree.Q059_Iterative_Method_to_find_Height_of_Binary_Tree
problems.geeks.tree.Q060_Construct_Complete_Binary_Tree_from_its_Linked_List_Representation
problems.geeks.tree.Q061_Difference_between_sums_of_odd_level_and_even_level_nodes_of_a_Binary_Tree
problems.geeks.tree.Q062_Print_Postorder_traversal_from_given_Inorder_and_Preorder_traversals
problems.geeks.tree.Q063_Find_depth_of_the_deepest_odd_level_leaf_node
problems.geeks.tree.Q064_Check_if_all_leaves_are_at_same_level
problems.geeks.tree.Q065_Add_all_greater_values_to_every_node_in_a_given_BST
problems.geeks.tree.Q066_Remove_all_nodes_which_donot_lie_in_any_path_with_sum_larger_than_or_equal_to_k
problems.geeks.tree.Q067_Extract_Leaves_of_a_Binary_Tree_in_a_Doubly_Linked_List
problems.geeks.tree.Q068_Deepest_left_leaf_node_in_a_binary_tree
problems.geeks.tree.Q069_Find_next_right_node_of_a_given_key
problems.geeks.tree.Q070_Sum_of_all_the_numbers_that_are_formed_from_root_to_leaf_paths
problems.geeks.tree.Q071_Print_all_nodes_that_donot_have_sibling
problems.geeks.tree.Q072_Find_distance_between_two_given_keys_of_a_Binary_Tree
problems.geeks.tree.Q073A_Print_all_nodes_that_are_at_distance_k_from_a_leaf_node
problems.geeks.tree.Q073B_Print_all_nodes_at_distance_k_from_a_given_node
problems.geeks.tree.Q074_Construct_a_tree_from_Inorder_and_Level_order_traversals
problems.geeks.tree.Q075_Reverse_alternate_levels_of_a_perfect_binary_tree
problems.geeks.tree.Q076_Find_the_maximum_path_sum_between_two_leaves_of_a_binary_tree
problems.geeks.tree.Q077_Inorder_predecessor_and_successor_for_a_given_key_in_BST
problems.geeks.tree.Q078_Check_if_two_nodes_are_cousins_in_a_Binary_Tree
problems.geeks.tree.Q079_Clone_a_Binary_Tree_with_Random_Pointers
problems.geeks.tree.Q079_Clone_a_Binary_Tree_with_Random_Pointers$TreeNode
problems.geeks.tree.Q080_Find_Height_of_Binary_Tree_represented_by_Parent_array

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

All Classes in problems.geeks.tree