Tree

Some important Tree functions

build tree -------> new node creation by recursive calls
level order traversal -------> Queue
inorder recursive -------> Recursion
inorder iterative -------> Stack
preorder recursive -------> Recursion
postorder recursive -------> Recursion
height O(n^2) -------> Recursive calls
height O(n) -------> level order traversal
diameter O(n^2) -------> Dia left -- Dia Right -- height(root)
diameter O(n) -------> using pair to store height (avoid recursive calls)
check balanced O(n^2) -------> condition = | H (left) - H (right) | <= 1
check balanced O(n) -------> using pair to store height
identical tree -------> inorder traversal & checking data elements
sum tree
top view
bootom view
left view
right view
diagnol traversal
zig-zag traversal
vertical order taversal
boundary traversal
k-sum paths
lowest common ancestor (LCA)
kth ancestor -----------> 2 approaches -> (vector & baktracking) and (reursion k--)
sum of longest bloodline
max sum of non - adjacent nodes
construct binary tree from preorder and inorder
construct binary tree from postorder and inorder
minimum time to burn a tree
Morris Inorder traversal (Threaded Binary Tree)
Morris Preorder traversal
Flatten a binary tree to linked list (Recursive)
Flatten a binary tree to linked list (Iterative) (Stack)
Flatten a binary tree to linked list (iterative) (Moriss-Traversal)

-----------------------------------------------------------------------

Name		Name	Last commit message	Last commit date
.vscode		.vscode
Bottom_view_tree.cpp		Bottom_view_tree.cpp
Kth_ancestor.cpp		Kth_ancestor.cpp
Lowest_coomon_ancestor_lca.cpp		Lowest_coomon_ancestor_lca.cpp
README.md		README.md
Top_view.cpp		Top_view.cpp
Tree_all_operations_functions_binary.cpp		Tree_all_operations_functions_binary.cpp
Tree_all_operations_functions_binary.exe		Tree_all_operations_functions_binary.exe
boundary_traversal.cpp		boundary_traversal.cpp
construct_binary_tree_from_inorder_postorder.cpp		construct_binary_tree_from_inorder_postorder.cpp
construct_binary_tree_from_inorder_preorder.cpp		construct_binary_tree_from_inorder_preorder.cpp
diagnol_traversal.cpp		diagnol_traversal.cpp
flatten_binary_tree_to_linked_list_iterative_stack.cpp		flatten_binary_tree_to_linked_list_iterative_stack.cpp
flatten_binary_tree_to_linked_list_recursion.cpp		flatten_binary_tree_to_linked_list_recursion.cpp
k_sum_paths_tree.cpp		k_sum_paths_tree.cpp
left_view_tree.cpp		left_view_tree.cpp
max_sum_non_adjacent_nodes.cpp		max_sum_non_adjacent_nodes.cpp
minimum_time_burn_tree.cpp		minimum_time_burn_tree.cpp
morris_inorder_traversal_threading.cpp		morris_inorder_traversal_threading.cpp
morris_preorder_traversal_threading.cpp		morris_preorder_traversal_threading.cpp
right_view_tree.cpp		right_view_tree.cpp
sum_longest_bloodline.cpp		sum_longest_bloodline.cpp
vertical_order_traversal.cpp		vertical_order_traversal.cpp
zig_zag_traversal.cpp		zig_zag_traversal.cpp
zig_zag_traversal.exe		zig_zag_traversal.exe