Data Structure - takeUforward

Kth largest/smallest element in Binary Search Tree

Problem statement: Given a binary search tree find the kth largest and smallest element in Binary Search Tree. Examples: Input:

Problem Statement: Given an array of integers A and an integer B. Find the total number of subarrays having bitwise

Problem Statement: Check for Symmetrical Binary Trees Write a program to check whether a binary tree is symmetrical or not.

Problem Statement: Write a program for Morris Inorder Traversal of a Binary Tree. Example: Input: Output: Inorder Traversal of this

Problem Statement: Given a sorted array of N integers, where every element except one appears exactly twice and one element

Problem Statement: Check Balanced Parentheses. Given string str containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[‘ and ‘]’, check

Problem Statement: Given an array of N integers. Find the elements that appear more than N/3 times in the array.

Problem Statement: Given a matrix m X n, count paths from left-top to the right bottom of a matrix with

Problem Statement: Given an array of N integers, your task is to find unique quads that add up to give

Problem Statement: Given an array of N integers, count the inversion of the array (using merge-sort). What is an inversion