Skip to content

Heap Data Structure

Tree Data Structure

Last Updated : 21 Mar, 2025

Tree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes.

tree-data-structure-banners-(2)

Basics of Tree Data Structure

Binary Tree

Binary Search Tree

AVL Tree

Red-Black Tree

Ternary Search Tree

n-ary or Generic Tree

B Tree

B+ Tree

Other types of Trees

Ternary Tree:
1. What is Ternary Tree
2. Create a Doubly Linked List from a Ternary Tree
Interval Tree:
1. Interval Tree
2. Interval Tree using GNU Tree-based container
2-3-4 Tree:
1. 2-3-4 Tree
2. 2-3 Trees | (Search, Insert, and Deletion)

Trees vs other Data Structures

Comparison among different Tree Data Structures

Problems based on Tree Data Structure

Problems	Difficulty Level	Solve
Height of Binary Tree	Easy	Solve
Determine if two trees are identical	Easy	Solve
Mirror tree	Easy	Solve
Symmetric Tree	Easy	Solve
Diameter of tree	Easy	Solve
Checked for Balanced tree	Easy	Solve
Children Sum Parent	Easy	Solve
Check for BST	Easy	Solve
Array to BST	Easy	Solve
Largest value in each level of binary tree	Easy	Solve
Maximum GCD of siblings of a binary tree	Easy	Solve
Zigzag Tree Traversal	Easy	Solve
Inorder Successor in BST	Easy	Solve
Kth Largest Element in a BST	Easy	Solve
Check if subtree	Medium	Solve
Single Valued Subtree	Medium	Solve
Unique BSTs	Medium	Solve
Inorder Traversal (iterative)	Medium	Solve
Preorder Traversal (iterative)	Medium	Solve
Postorder Traversal(iterative)	Medium	Solve
Vertical Traversal of a Binary Tree	Medium	Solve
Boundary Traversal	Medium	Solve
Construct Binary Tree from Parent array	Medium	Solve
Construct Binary Tree from Preorder and Inorder Traversal	Medium	Solve
Preorder Traversal and BST	Medium	Solve
Construct tree from preorder traversal	Medium	Solve
Minimum distance between two given nodes	Medium	Solve
Maximum sum leaf to root path	Medium	Solve
Odd Even Level Difference	Medium	Solve
Lowest Common Ancestor of a Binary Tree	Medium	Solve
Ancestors in Binary Tree	Medium	Solve
Remove BST keys outside the given range	Medium	Solve
Pair with given target in BST	Medium	Solve
Sum Tree	Medium	Solve
BST to greater sum tree	Medium	Solve
BST to max heap	Medium	Solve
Clone binary tree with random pointer	Medium	Solve
Maximum sum of non adjacent nodes	Medium	Solve
Largest BST in a Binary Tree	Medium	Solve
Extreme nodes in alternate order	Medium	Solve
Connect nodes at same level	Hard	Solve
Nodes at given distance in a Binary Tree	Hard	Solve
Sorted Linked List to BST	Hard	Solve
Binary Tree to Doubly Linked List	Hard	Solve
Maximum sum path between two leaf nodes	Hard	Solve
K-Sum Paths	Hard	Solve
Number of turns in a binary tree	Hard	Solve
Merge two BST’s	Hard	Solve
Fixing two nodes of a BST	Hard	Solve
Burn Binary Tree	Hard	Solve

Quick Links:

Heap Data Structure

kartik

Improve

Article Tags :

Tree
DSA

Practice Tags :

Tree

Similar Reads

DSA Tutorial - Learn Data Structures and Algorithms

DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on

Array Data Structure Guide

In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous

String in Data Structure

A string is a sequence of characters. The following facts make string an interesting data structure. Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immu

Matrix Data Structure

Matrix Data Structure is a two-dimensional array arranged in rows and columns. It is commonly used to represent mathematical matrices and is fundamental in various fields like mathematics, computer graphics, and data processing. Matrices allow for efficient storage and manipulation of data in a stru

Searching Algorithms

Searching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input

Sorting Algorithms

A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ

Hashing in Data Structure

Hashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The

Two Pointers Technique

Two pointers is really an easy and effective technique that is typically used for Two Sum in Sorted Arrays, Closest Two Sum, Three Sum, Four Sum, Trapping Rain Water and many other popular interview questions. Given a sorted array arr (sorted in ascending order) and a target, find if there exists an

Sliding Window Technique

Sliding Window problems involve moving a fixed or variable-size window through a data structure, typically an array or string, to solve problems efficiently based on continuous subsets of elements. This technique is used when we need to find subarrays or substrings according to a given set of condit

Prefix Sum Array - Implementation and Applications

Given an array arr[] of size n, the task is to find the prefix sum of the array. A prefix sum array is another array prefixSum[] of the same size, such that prefixSum[i] is arr[0] + arr[1] + arr[2] . . . arr[i]. Examples: Input: arr[] = [10, 20, 10, 5, 15]Output: 10 30 40 45 60Explanation: For each