- Binary Tree Introduction
- Binary Tree Properties
- Types of Binary Tree
- Handshaking Lemma and Interesting Tree Properties
- Enumeration of Binary Tree
- Applications of tree data structure
- Tree Traversals
- BFS vs DFS for Binary Tree
- Level Order Tree Traversal
- Print level order traversal line by line
- Inorder Tree Traversal without Recursion
- Inorder Tree Traversal without recursion and without stack!
- Threaded Binary Tree
- Size of a tree
- Determine if Two Trees are Identical
- Maximum Depth or Height of a Tree
- Write a C program to Delete a Tree.
- Write an Efficient C Function to Convert a Binary Tree into its Mirror Tree
- If you are given two traversal sequences, can you construct the binary tree?
- Given a binary tree, print out all of its root-to-leaf paths one per line.
- The Great Tree-List Recursion Problem.
- Count leaf nodes in a binary tree
- Level order traversal in spiral form
- Check for Children Sum Property in a Binary Tree.
- Convert an arbitrary Binary Tree to a tree that holds Children Sum Property
- Diameter of a Binary Tree
- How to determine if a binary tree is height-balanced?
- Root to leaf path sum equal to a given number
- Construct Tree from given Inorder and Preorder traversals
- Given a binary tree, print all root-to-leaf paths
- Double Tree
- Maximum width of a binary tree
- Foldable Binary Trees
- Print nodes at k distance from root
- Get Level of a node in a Binary Tree
- Print Ancestors of a given node in Binary Tree
- Check if a given Binary Tree is SumTree
- Check if a binary tree is subtree of another binary tree
- Connect nodes at same level
- Connect nodes at same level using constant extra space
- Populate Inorder Successor for all nodes
- Convert a given tree to its Sum Tree
- Vertical Sum in a given Binary Tree
- Find the maximum sum leaf to root path in a Binary Tree
- Construct Special Binary Tree from given Inorder traversal
- Construct a special tree from given preorder traversal
- Check whether a given Binary Tree is Complete or not
- Boundary Traversal of binary tree
- Construct Full Binary Tree from given preorder and postorder traversals
- Iterative Preorder Traversal
- Morris traversal for Preorder
- Linked complete binary tree & its creation
- Ternary Search Tree
- Largest Independent Set Problem
- Iterative Postorder Traversal | Set 1 (Using Two Stacks)
- Iterative Postorder Traversal | Set 2 (Using One Stack)
- Reverse Level Order Traversal
- Construct Complete Binary Tree from its Linked List Representation
- Convert a given Binary Tree to Doubly Linked List | Set 1
- Tree Isomorphism Problem
- Find all possible interpretations of an array of digits
- Iterative Method to find Height of Binary Tree
- Custom Tree Problem
- Convert a given Binary Tree to Doubly Linked List | Set 2
- Print ancestors of a given binary tree node without recursion
- Difference between sums of odd level and even level nodes of a Binary Tree
- Print Postorder traversal from given Inorder and Preorder traversals
- Find depth of the deepest odd level leaf node
- Check if all leaves are at same level
- Print Left View of a Binary Tree
- Remove all nodes which don’t lie in any path with sum>= k
- Extract Leaves of a Binary Tree in a Doubly Linked List
- Deepest left leaf node in a binary tree
- Find next right node of a given key
- Sum of all the numbers that are formed from root to leaf paths
- Convert a given Binary Tree to Doubly Linked List | Set 3
- Lowest Common Ancestor in a Binary Tree | Set 1
- Find distance between two given keys of a Binary Tree
- Print all nodes that are at distance k from a leaf node
- Check if a given Binary Tree is height balanced like a Red-Black Tree,
- Print all nodes at distance k from a given node
- Print a Binary Tree in Vertical Order | Set 1
- Construct a tree from Inorder and Level order traversals
- Find the maximum path sum between two leaves of a binary tree
- Reverse alternate levels of a perfect binary tree
- Check if two nodes are cousins in a Binary Tree
- Check if a binary tree is subtree of another binary tree | Set 2
- Serialize and Deserialize a Binary Tree
- Print nodes between two given level numbers of a binary tree
- closest leaf in a Binary Tree
- Convert a Binary Tree to Threaded binary tree
- Print Nodes in Top View of Binary Tree
- Bottom View of a Binary Tree
- Perfect Binary Tree Specific Level Order Traversal
- Convert left-right representation of a bianry tree to down-right
- Minimum no. of iterations to pass information to all nodes in the tree
- Clone a Binary Tree with Random Pointers
- Given a binary tree, how do you remove all the half nodes?
- Vertex Cover Problem | Set 2 (Dynamic Programming Solution for Tree)
- Check whether a binary tree is a full binary tree or not
- Find sum of all left leaves in a given Binary Tree
- Remove nodes on root to leaf paths of length < K
- Find Count of Single Valued Subtrees
- Check if a given array can represent Preorder Traversal of Binary Search Tree
- Mirror of n-ary Tree
- Find multiplication of sums of data of leaves at same levels
- Succinct Encoding of Binary Tree
- Construct Binary Tree from given Parent Array representation
- Symmetric Tree (Mirror Image of itself)
- Find Minimum Depth of a Binary Tree
- Maximum Path Sum in a Binary Tree
- Expression Tree
- Check whether a binary tree is a complete tree or not | Set 2 (Recursive Solution)
- Change a Binary Tree so that every node stores sum of all nodes in left subtree
- Iterative Search for a key ‘x’ in Binary Tree
- More Articles on Trees…

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.