Given a Binary Search Tree, find the median of it.
- If number of nodes are even: then median = ((n/2th node + ((n)/2th+1) node) /2
- If number of nodes are odd: then median = (n+1)/2th node.
Examples:
Input:
Example of BST
Output: median of Below BST is 6.
Explanation: Inorder of Given BST will be
1, 3, 4, 6, 7, 8, 9 So, here median will 6.
Given BST:
Output: median of Below BST is 12
Median Of BST using Morris Inorder Traversal:
The idea is based on K’th smallest element in BST using O(1) Extra Space.
The task is very simple if we are allowed to use extra space but Inorder to traversal using recursion and stack both use Space which is not allowed here. So, the solution is to do Morris Inorder traversal as it doesn't require extra space.
Follow the steps mentioned below to implement the idea:
- Count the number of nodes in the given BST using Morris Inorder Traversal.
- Then perform Morris Inorder traversal one more time by counting nodes and by checking if the count is equal to the median point.
- To consider even no. of nodes, an extra pointer pointing to the previous node is used.
Below is the implementation of the above approach:
C++
/* C++ program to find the median of BST in O(n)
time and O(1) space*/
#include<bits/stdc++.h>
using namespace std;
/* A binary search tree Node has data, pointer
to left child and a pointer to right child */
struct Node
{
int data;
struct Node* left, *right;
};
// A utility function to create a new BST node
struct Node *newNode(int item)
{
struct Node *temp = new Node;
temp->data = item;
temp->left = temp->right = NULL;
return temp;
}
/* A utility function to insert a new node with
given key in BST */
struct Node* insert(struct Node* node, int key)
{
/* If the tree is empty, return a new node */
if (node == NULL) return newNode(key);
/* Otherwise, recur down the tree */
if (key < node->data)
node->left = insert(node->left, key);
else if (key > node->data)
node->right = insert(node->right, key);
/* return the (unchanged) node pointer */
return node;
}
/* Function to count nodes in a binary search tree
using Morris Inorder traversal*/
int counNodes(struct Node *root)
{
struct Node *current, *pre;
// Initialise count of nodes as 0
int count = 0;
if (root == NULL)
return count;
current = root;
while (current != NULL)
{
if (current->left == NULL)
{
// Count node if its left is NULL
count++;
// Move to its right
current = current->right;
}
else
{
/* Find the inorder predecessor of current */
pre = current->left;
while (pre->right != NULL &&
pre->right != current)
pre = pre->right;
/* Make current as right child of its
inorder predecessor */
if(pre->right == NULL)
{
pre->right = current;
current = current->left;
}
/* Revert the changes made in if part to
restore the original tree i.e., fix
the right child of predecessor */
else
{
pre->right = NULL;
// Increment count if the current
// node is to be visited
count++;
current = current->right;
} /* End of if condition pre->right == NULL */
} /* End of if condition current->left == NULL*/
} /* End of while */
return count;
}
/* Function to find median in O(n) time and O(1) space
using Morris Inorder traversal*/
int findMedian(struct Node *root)
{
if (root == NULL)
return 0;
int count = counNodes(root);
int currCount = 0;
struct Node *current = root, *pre, *prev;
while (current != NULL)
{
if (current->left == NULL)
{
// count current node
currCount++;
// check if current node is the median
// Odd case
if (count % 2 != 0 && currCount == (count+1)/2)
return current->data;
// Even case
else if (count % 2 == 0 && currCount == (count/2)+1)
return (prev->data + current->data)/2;
// Update prev for even no. of nodes
prev = current;
//Move to the right
current = current->right;
}
else
{
/* Find the inorder predecessor of current */
pre = current->left;
while (pre->right != NULL && pre->right != current)
pre = pre->right;
/* Make current as right child of its inorder predecessor */
if (pre->right == NULL)
{
pre->right = current;
current = current->left;
}
/* Revert the changes made in if part to restore the original
tree i.e., fix the right child of predecessor */
else
{
pre->right = NULL;
prev = pre;
// Count current node
currCount++;
// Check if the current node is the median
if (count % 2 != 0 && currCount == (count+1)/2 )
return current->data;
else if (count%2==0 && currCount == (count/2)+1)
return (prev->data+current->data)/2;
// update prev node for the case of even
// no. of nodes
prev = current;
current = current->right;
} /* End of if condition pre->right == NULL */
} /* End of if condition current->left == NULL*/
} /* End of while */
}
/* Driver program to test above functions*/
int main()
{
/* Let us create following BST
50
/ \
30 70
/ \ / \
20 40 60 80 */
struct Node *root = NULL;
root = insert(root, 50);
insert(root, 30);
insert(root, 20);
insert(root, 40);
insert(root, 70);
insert(root, 60);
insert(root, 80);
cout << "\nMedian of BST is "
<< findMedian(root);
return 0;
}
/* Java program to find the median of BST in O(n)
time and O(1) space*/
class GfG {
/* A binary search tree Node has data, pointer
to left child and a pointer to right child */
static class Node
{
int data;
Node left, right;
}
// A utility function to create a new BST node
static Node newNode(int item)
{
Node temp = new Node();
temp.data = item;
temp.left = null;
temp.right = null;
return temp;
}
/* A utility function to insert a new node with
given key in BST */
static Node insert(Node node, int key)
{
/* If the tree is empty, return a new node */
if (node == null) return newNode(key);
/* Otherwise, recur down the tree */
if (key < node.data)
node.left = insert(node.left, key);
else if (key > node.data)
node.right = insert(node.right, key);
/* return the (unchanged) node pointer */
return node;
}
/* Function to count nodes in a binary search tree
using Morris Inorder traversal*/
static int counNodes(Node root)
{
Node current, pre;
// Initialise count of nodes as 0
int count = 0;
if (root == null)
return count;
current = root;
while (current != null)
{
if (current.left == null)
{
// Count node if its left is NULL
count++;
// Move to its right
current = current.right;
}
else
{
/* Find the inorder predecessor of current */
pre = current.left;
while (pre.right != null &&
pre.right != current)
pre = pre.right;
/* Make current as right child of its
inorder predecessor */
if(pre.right == null)
{
pre.right = current;
current = current.left;
}
/* Revert the changes made in if part to
restore the original tree i.e., fix
the right child of predecessor */
else
{
pre.right = null;
// Increment count if the current
// node is to be visited
count++;
current = current.right;
} /* End of if condition pre->right == NULL */
} /* End of if condition current->left == NULL*/
} /* End of while */
return count;
}
/* Function to find median in O(n) time and O(1) space
using Morris Inorder traversal*/
static int findMedian(Node root)
{
if (root == null)
return 0;
int count = counNodes(root);
int currCount = 0;
Node current = root, pre = null, prev = null;
while (current != null)
{
if (current.left == null)
{
// count current node
currCount++;
// check if current node is the median
// Odd case
if (count % 2 != 0 && currCount == (count+1)/2)
return current.data;
// Even case
else if (count % 2 == 0 && currCount == (count/2)+1)
return (prev.data + current.data)/2;
// Update prev for even no. of nodes
prev = current;
//Move to the right
current = current.right;
}
else
{
/* Find the inorder predecessor of current */
pre = current.left;
while (pre.right != null && pre.right != current)
pre = pre.right;
/* Make current as right child of its inorder predecessor */
if (pre.right == null)
{
pre.right = current;
current = current.left;
}
/* Revert the changes made in if part to restore the original
tree i.e., fix the right child of predecessor */
else
{
pre.right = null;
prev = pre;
// Count current node
currCount++;
// Check if the current node is the median
if (count % 2 != 0 && currCount == (count+1)/2 )
return current.data;
else if (count%2==0 && currCount == (count/2)+1)
return (prev.data+current.data)/2;
// update prev node for the case of even
// no. of nodes
prev = current;
current = current.right;
} /* End of if condition pre->right == NULL */
} /* End of if condition current->left == NULL*/
} /* End of while */
return -1;
}
/* Driver code*/
public static void main(String[] args)
{
/* Let us create following BST
50
/ \
30 70
/ \ / \
20 40 60 80 */
Node root = null;
root = insert(root, 50);
insert(root, 30);
insert(root, 20);
insert(root, 40);
insert(root, 70);
insert(root, 60);
insert(root, 80);
System.out.println("Median of BST is " + findMedian(root));
}
}
// This code is contributed by prerna saini.
# Python program to find closest
# value in Binary search Tree
_MIN=-2147483648
_MAX=2147483648
# Helper function that allocates
# a new node with the given data
# and None left and right pointers.
class newNode:
# Constructor to create a new node
def __init__(self, data):
self.data = data
self.left = None
self.right = None
""" A utility function to insert a new node with
given key in BST """
def insert(node,key):
""" If the tree is empty, return a new node """
if (node == None):
return newNode(key)
""" Otherwise, recur down the tree """
if (key < node.data):
node.left = insert(node.left, key)
elif (key > node.data):
node.right = insert(node.right, key)
""" return the (unchanged) node pointer """
return node
""" Function to count nodes in
a binary search tree using
Morris Inorder traversal"""
def counNodes(root):
# Initialise count of nodes as 0
count = 0
if (root == None):
return count
current = root
while (current != None):
if (current.left == None):
# Count node if its left is None
count+=1
# Move to its right
current = current.right
else:
""" Find the inorder predecessor of current """
pre = current.left
while (pre.right != None and
pre.right != current):
pre = pre.right
""" Make current as right child of its
inorder predecessor """
if(pre.right == None):
pre.right = current
current = current.left
else:
pre.right = None
# Increment count if the current
# node is to be visited
count += 1
current = current.right
return count
""" Function to find median in
O(n) time and O(1) space
using Morris Inorder traversal"""
def findMedian(root):
if (root == None):
return 0
count = counNodes(root)
currCount = 0
current = root
while (current != None):
if (current.left == None):
# count current node
currCount += 1
# check if current node is the median
# Odd case
if (count % 2 != 0 and
currCount == (count + 1)//2):
return current.data
# Even case
elif (count % 2 == 0 and
currCount == (count//2)+1):
return (prev.data + current.data)//2
# Update prev for even no. of nodes
prev = current
#Move to the right
current = current.right
else:
""" Find the inorder predecessor of current """
pre = current.left
while (pre.right != None and
pre.right != current):
pre = pre.right
""" Make current as right child
of its inorder predecessor """
if (pre.right == None):
pre.right = current
current = current.left
else:
pre.right = None
prev = pre
# Count current node
currCount+= 1
# Check if the current node is the median
if (count % 2 != 0 and
currCount == (count + 1) // 2 ):
return current.data
elif (count%2 == 0 and
currCount == (count // 2) + 1):
return (prev.data+current.data)//2
# update prev node for the case of even
# no. of nodes
prev = current
current = current.right
# Driver Code
if __name__ == '__main__':
""" Constructed binary tree is
50
/ \
30 70
/ \ / \
20 40 60 80 """
root = newNode(50)
insert(root, 30)
insert(root, 20)
insert(root, 40)
insert(root, 70)
insert(root, 60)
insert(root, 80)
print("Median of BST is ",findMedian(root))
# This code is contributed
# Shubham Singh(SHUBHAMSINGH10)
/* C# program to find the median of BST in O(n)
time and O(1) space*/
using System;
class GfG
{
/* A binary search tree Node has data, pointer
to left child and a pointer to right child */
public class Node
{
public int data;
public Node left, right;
}
// A utility function to create a new BST node
static Node newNode(int item)
{
Node temp = new Node();
temp.data = item;
temp.left = null;
temp.right = null;
return temp;
}
/* A utility function to insert a new node with
given key in BST */
static Node insert(Node node, int key)
{
/* If the tree is empty, return a new node */
if (node == null) return newNode(key);
/* Otherwise, recur down the tree */
if (key < node.data)
node.left = insert(node.left, key);
else if (key > node.data)
node.right = insert(node.right, key);
/* return the (unchanged) node pointer */
return node;
}
/* Function to count nodes in a binary search tree
using Morris Inorder traversal*/
static int counNodes(Node root)
{
Node current, pre;
// Initialise count of nodes as 0
int count = 0;
if (root == null)
return count;
current = root;
while (current != null)
{
if (current.left == null)
{
// Count node if its left is NULL
count++;
// Move to its right
current = current.right;
}
else
{
/* Find the inorder predecessor of current */
pre = current.left;
while (pre.right != null &&
pre.right != current)
pre = pre.right;
/* Make current as right child of its
inorder predecessor */
if(pre.right == null)
{
pre.right = current;
current = current.left;
}
/* Revert the changes made in if part to
restore the original tree i.e., fix
the right child of predecessor */
else
{
pre.right = null;
// Increment count if the current
// node is to be visited
count++;
current = current.right;
} /* End of if condition pre->right == NULL */
} /* End of if condition current->left == NULL*/
} /* End of while */
return count;
}
/* Function to find median in O(n) time and O(1) space
using Morris Inorder traversal*/
static int findMedian(Node root)
{
if (root == null)
return 0;
int count = counNodes(root);
int currCount = 0;
Node current = root, pre = null, prev = null;
while (current != null)
{
if (current.left == null)
{
// count current node
currCount++;
// check if current node is the median
// Odd case
if (count % 2 != 0 && currCount == (count+1)/2)
return current.data;
// Even case
else if (count % 2 == 0 && currCount == (count/2)+1)
return (prev.data + current.data)/2;
// Update prev for even no. of nodes
prev = current;
//Move to the right
current = current.right;
}
else
{
/* Find the inorder predecessor of current */
pre = current.left;
while (pre.right != null && pre.right != current)
pre = pre.right;
/* Make current as right child of its inorder predecessor */
if (pre.right == null)
{
pre.right = current;
current = current.left;
}
/* Revert the changes made in if part to restore the original
tree i.e., fix the right child of predecessor */
else
{
pre.right = null;
prev = pre;
// Count current node
currCount++;
// Check if the current node is the median
if (count % 2 != 0 && currCount == (count+1)/2 )
return current.data;
else if (count % 2 == 0 && currCount == (count/2)+1)
return (prev.data + current.data)/2;
// update prev node for the case of even
// no. of nodes
prev = current;
current = current.right;
} /* End of if condition pre->right == NULL */
} /* End of if condition current->left == NULL*/
} /* End of while */
return -1;
}
/* Driver code*/
public static void Main(String []args)
{
/* Let us create following BST
50
/ \
30 70
/ \ / \
20 40 60 80 */
Node root = null;
root = insert(root, 50);
insert(root, 30);
insert(root, 20);
insert(root, 40);
insert(root, 70);
insert(root, 60);
insert(root, 80);
Console.WriteLine("Median of BST is " + findMedian(root));
}
}
// This code is contributed by Arnab Kundu
<script>
/* JavaScript program to find
the median of BST in O(n)
time and O(1) space*/
/* A binary search tree Node has data, pointer
to left child and a pointer to right child */
class Node {
constructor() {
this.data = 0;
this.left = null;
this.right = null;
}
}
// A utility function to create a new BST node
function newNode(item)
{
var temp = new Node();
temp.data = item;
temp.left = null;
temp.right = null;
return temp;
}
/* A utility function to insert a new node with
given key in BST */
function insert(node , key)
{
/* If the tree is empty, return a new node */
if (node == null) return newNode(key);
/* Otherwise, recur down the tree */
if (key < node.data)
node.left = insert(node.left, key);
else if (key > node.data)
node.right = insert(node.right, key);
/* return the (unchanged) node pointer */
return node;
}
/* Function to count nodes in a binary search tree
using Morris Inorder traversal*/
function counNodes(root)
{
var current, pre;
// Initialise count of nodes as 0
var count = 0;
if (root == null)
return count;
current = root;
while (current != null)
{
if (current.left == null)
{
// Count node if its left is NULL
count++;
// Move to its right
current = current.right;
}
else
{
/* Find the inorder predecessor of current */
pre = current.left;
while (pre.right != null &&
pre.right != current)
pre = pre.right;
/* Make current as right child of its
inorder predecessor */
if(pre.right == null)
{
pre.right = current;
current = current.left;
}
/* Revert the changes made in if part to
restore the original tree i.e., fix
the right child of predecessor */
else
{
pre.right = null;
// Increment count if the current
// node is to be visited
count++;
current = current.right;
} /* End of if condition pre->right == NULL */
} /* End of if condition current->left == NULL*/
} /* End of while */
return count;
} /* Function to find median in O(n) time and O(1) space
using Morris Inorder traversal*/
function findMedian(root)
{
if (root == null)
return 0;
var count = counNodes(root);
var currCount = 0;
var current = root, pre = null, prev = null;
while (current != null)
{
if (current.left == null)
{
// count current node
currCount++;
// check if current node is the median
// Odd case
if (count % 2 != 0 &&
currCount == (count+1)/2)
return current.data;
// Even case
else if (count % 2 == 0 &&
currCount == (count/2)+1)
return (prev.data + current.data)/2;
// Update prev for even no. of nodes
prev = current;
//Move to the right
current = current.right;
}
else
{
/* Find the inorder predecessor of current */
pre = current.left;
while (pre.right != null &&
pre.right != current)
pre = pre.right;
/* Make current as right child of its
inorder predecessor */
if (pre.right == null)
{
pre.right = current;
current = current.left;
}
/* Revert the changes made in if
part to restore the original
tree i.e., fix the right child of predecessor */
else
{
pre.right = null;
prev = pre;
// Count current node
currCount++;
// Check if the current node is the median
if (count % 2 != 0 &&
currCount == (count+1)/2 )
return current.data;
else if (count%2==0 &&
currCount == (count/2)+1)
return (prev.data+current.data)/2;
// update prev node for the case of even
// no. of nodes
prev = current;
current = current.right;
} /* End of if condition pre->right == NULL */
} /* End of if condition current->left == NULL*/
} /* End of while */
return -1;
}
/* Driver code*/
/* Let us create following BST
50
/ \
30 70
/ \ / \
20 40 60 80 */
var root = null;
root = insert(root, 50);
insert(root, 30);
insert(root, 20);
insert(root, 40);
insert(root, 70);
insert(root, 60);
insert(root, 80);
document.write("Median of BST is " + findMedian(root));
// This code is contributed by todaysgaurav
</script>
OutputMedian of BST is 50
Time Complexity: O(N)
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn 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
3 min read
String in Data StructureA 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 immut
2 min read
Hashing in Data StructureHashing 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
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree 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. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching 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
2 min read
Sorting AlgorithmsA 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
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem