Basic Tree Programs in C for Freshers
Basic Tree Programs
| # | Program Name | Description | Resources |
|---|---|---|---|
| 1 | Tree Node Structure | Implement basic tree node structure | GeeksforGeeks |
| 2 | Create Binary Tree | Create a simple binary tree | GeeksforGeeks |
| 3 | Tree Traversal (Inorder) | Implement inorder traversal | GeeksforGeeks |
| 4 | Tree Traversal (Preorder) | Implement preorder traversal | GeeksforGeeks |
| 5 | Tree Traversal (Postorder) | Implement postorder traversal | GeeksforGeeks |
| 6 | Tree Height | Calculate height of a tree | GeeksforGeeks |
| 7 | Count Leaf Nodes | Count all leaf nodes in tree | GeeksforGeeks |
| 8 | Count Total Nodes | Count all nodes in tree | GeeksforGeeks |
| 9 | Check Full Binary Tree | Check if tree is full binary tree | GeeksforGeeks |
| 10 | Check Complete Binary Tree | Check if tree is complete binary tree | GeeksforGeeks |
| 11 | BST Insertion | Insert node in BST | GeeksforGeeks |
| 12 | BST Search | Search node in BST | GeeksforGeeks |
| 13 | BST Deletion | Delete node from BST | GeeksforGeeks |
| 14 | Check BST | Check if tree is BST | GeeksforGeeks |
| 15 | BST Minimum Value | Find minimum value in BST | GeeksforGeeks |
| 16 | Level Order Traversal | BFS traversal of tree | GeeksforGeeks |
| 17 | Reverse Level Order | Bottom-up level order traversal | GeeksforGeeks |
| 18 | Spiral Level Order | Spiral/Zigzag traversal | GeeksforGeeks |
| 19 | Boundary Traversal | Traverse boundary nodes | GeeksforGeeks |
| 20 | Diagonal Traversal | Diagonal traversal of tree | GeeksforGeeks |
| 21 | Tree from Inorder/Preorder | Construct tree from traversals | GeeksforGeeks |
| 22 | Tree from Inorder/Postorder | Construct tree from traversals | GeeksforGeeks |
| 23 | Tree from Level Order | Construct tree from level order | GeeksforGeeks |
| 24 | Mirror Tree | Create mirror of binary tree | GeeksforGeeks |
| 25 | Double Tree | Create double tree | GeeksforGeeks |
| 26 | Check Identical Trees | Check if two trees are identical | GeeksforGeeks |
| 27 | Check Subtree | Check if tree is subtree | GeeksforGeeks |
| 28 | Check Symmetric Tree | Check if tree is symmetric | GeeksforGeeks |
| 29 | Check Balanced Tree | Check if tree is balanced | GeeksforGeeks |
| 30 | Diameter of Tree | Find diameter of tree | GeeksforGeeks |
| 31 | Root to Leaf Paths | Print all root to leaf paths | GeeksforGeeks |
| 32 | Has Path Sum | Check path with given sum | GeeksforGeeks |
| 33 | Maximum Path Sum | Find maximum path sum | GeeksforGeeks |
| 34 | Lowest Common Ancestor | Find LCA of two nodes | GeeksforGeeks |
| 35 | Distance Between Nodes | Find distance between two nodes | GeeksforGeeks |
| 36 | Vertical Order Traversal | Print vertical order | GeeksforGeeks |
| 37 | Top View of Tree | Print top view | GeeksforGeeks |
| 38 | Bottom View of Tree | Print bottom view | GeeksforGeeks |
| 39 | Left View of Tree | Print left view | GeeksforGeeks |
| 40 | Right View of Tree | Print right view | GeeksforGeeks |
| 41 | Sum Tree | Check if tree is sum tree | GeeksforGeeks |
| 42 | Convert to Sum Tree | Convert tree to sum tree | GeeksforGeeks |
| 43 | Convert to Mirror Tree | Convert tree to its mirror | GeeksforGeeks |
| 44 | Check Children Sum Property | Check children sum property | GeeksforGeeks |
| 45 | Populate Inorder Successor | Populate inorder successor | GeeksforGeeks |
| 46 | BST Floor Value | Find floor value in BST | GeeksforGeeks |
| 47 | BST Ceil Value | Find ceil value in BST | GeeksforGeeks |
| 48 | BST Kth Smallest | Find kth smallest element | GeeksforGeeks |
| 49 | BST Kth Largest | Find kth largest element | GeeksforGeeks |
| 50 | Sorted Array to BST | Convert sorted array to BST | GeeksforGeeks |
Related Tree Resources