Binary Tree Data Structure Last Updated : 15 Dec, 2025 Comments Improve Suggest changes 17 Likes Like Report A Binary Tree Data Structure is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. Introduction Introduction Properties Types Applications & Limitations Enumeration Basic Operations Inorder, Preorder &, Postorder Traversals Level Order Tree Traversal Max Depth or Height Insertion & Deletion Easy Problems Size of a tree Max in TreeSum Tree Identical Trees Mirror Tree Cousins in Tree Perfect Binary Tree Foldable Binary Trees Symmetric Tree (Mirror Image of itself) Subtree with Given SumSuccinct Encoding of Binary Tree Get Level of a Node Check for Complete Binary Tree Depth of a full Binary Tree from Preorder More Traversals BFS vs DFS for Binary Tree Iterative Inorder Iterative Preorder Iterative Postorder Traversal Using Two Stacks Morris Traversal Morris traversal for Preorder Morris Traversal for Postorder Medium Problems Diameter of a Binary Tree Duplicate Subtrees Removing an edge divides in two halves ?Level order traversal in spiral form Reverse Level Order Traversal Tree from Inorder and Level order Clone a Binary Tree with Random PointersAll possible binary trees with given Inorder Populate Inorder Successors Complete Binary Tree from Linked List Min swaps to convert to BST Binary Tree to Doubly Linked List Convert a tree to forest of even nodes Flip Binary Tree Root to leaf paths without using recursion Check if Preorder, Inorder and Postorder are of same tree Check for Subtree Maximum subtree sum Maximum sum with no two adjacent Lowest Common Ancestor Height of a generic tree from parent array Distance between two given keys Diagonal Traversal of Binary Tree Boundary Traversal of binary tree Hard ProblemsMin Time to Burn from Leaf Modify a binary tree to get Preorder traversal using right pointers Full Binary Tree using its Preorder and Mirror's Preorder A special tree from given preorder Tree from ancestor matrix Full k-ary tree from its preorder Binary Tree from String with bracket representation Binary Tree into Doubly Linked List in spiral fashion Binary Tree to a Circular Doubly Link List Ternary Expression to a Binary Tree Check if there is a root to leaf path with given sequence Remove all nodes which don’t lie in any path with sum>= k Maximum spiral sum in Binary Tree Sum of nodes at k-th level in a tree represented as string Sum of all the numbers that are formed from root to leaf paths Merge Two Binary Trees by doing Node Sum (Recursive and Iterative) Root of the tree from children ID sums Quick Links : 'Practice Problems' on Trees 'Quizzes' on Binary Trees Learn Data Structure and Algorithms | DSA Tutorial Top Interview Questions on Tree Create Quiz Comment H harendrakumar123 Follow 17 Improve H harendrakumar123 Follow 17 Improve Article Tags : Tree DSA Explore DSA FundamentalsLogic Building Problems 2 min read Analysis of Algorithms 1 min read Data StructuresArray Data Structure 3 min read String in Data Structure 2 min read Hashing in Data Structure 2 min read Linked List Data Structure 3 min read Stack Data Structure 2 min read Queue Data Structure 2 min read Tree Data Structure 2 min read Graph Data Structure 3 min read Trie Data Structure 15+ min read AlgorithmsSearching Algorithms 2 min read Sorting Algorithms 3 min read Introduction to Recursion 15 min read Greedy Algorithms 3 min read Graph Algorithms 3 min read Dynamic Programming or DP 3 min read Bitwise Algorithms 4 min read AdvancedSegment Tree 2 min read Binary Indexed Tree or Fenwick Tree 15 min read Square Root (Sqrt) Decomposition Algorithm 15+ min read Binary Lifting 15+ min read Geometry 2 min read Interview PreparationInterview Corner 3 min read GfG160 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding Platform 1 min read Problem of The Day - Develop the Habit of Coding 5 min read Like