Data Structure interview questions – page 19

The number of total nodes in a complete balanced binary tree with n levels is, a)3^n + 1 b)2^(n+1) - 1 c) 2^n + 1 d) none of above

Find 5th Maximum in BST given bst is of 4 / 2 6 / / 1 3 5 7

Given an array of integers, {1,0,2,0,3,0,0,4,5,6,7,0,0,0}, you have to create a new array which will be like (1,2,3,4,5,6,7,0,0,0,0,0,0,0}, without using any other temporary array.

Create a minimally skewed tree from the given Inorder. There can be many trees possible trees from Inorder, but we want minimally skewed.

You have a binary search tree and you have to return the two nodes such that there sum i equal to 'K'. Pseudo code is to be given. O(n)time & O(n) sppace is easy but challenge O(n) time & O(1) space.

You are provided with a stream of integers, design a data structure to store the number of occurrences of each integer.

Find Level Sum of a binary tree and Store that in an Array? eg

Write a Program to remove loop from linked list..program should be clean & should pass all test cases..he wants from me exact working code In O(n)..??

Convert binary search tree to max heap

You are given a singly link-list such that each node of this list is also a head of another link list of the same type. So, how does one flatten the linked-list

Given a binary tree, find the largest subtree that's also a BST.

Given a large string, you have to find out largest string such that all its character are consecutive.

Remove duplicates from a given unsorted array.

Write a code to find the tree from a given tree such that each node in resultent node value= sum of it's childs

Given a table of prefix rules (similar to regex) and the corresponding actions. Given a string, find the most specific rule that can be applied and carry out the corresponding action. For ex, a.*->f1() a.b.c.*->f2()<b...

Removing all the repeated character of string in O(1) space given all would be in [A-Z a-z]

To concatenate two linked lists strings, the order is O(1) is obtained for what kind of list?

Implement your own hash map from scratch. Make it thread safe.

1) Given a stack and an input string of 1234.At any point you can do anyone of the follow i. take the next input symbol and Enque. ii. you can pop as many as you can. When ever you pop an element it will be printed (you cannot po...

Given a long string, arrange the words in alphabetical order, delete the duplicates and output the words with their frequency.

Given two sorted lists of size N1 and N2, find the median of all elements in O(log N) time where N = N1 + N2. ....

Define a data struct for the search engine which will represent whether given word is there in the document or not .It should be fast.

Write BST(Binary Search Tree) into file and read from file

Given a pointer to a node in a singly linked list, how do you delete the node?

Find the median of a Binary Search Tree. You are passed the root of the tree, and you should return the median which is the middle element, if the number of elements is odd, or the average of the two middle elements if the number of elements is ev...

You are given a threaded binary tree where each node of the tree points to some node to the right of it in-order traversal. Given such tree, check whether each thread pointer of the node in a tree satisfies this condition( i.e check whether if thr...

A rooted binary tree with keys in its nodes has the binary search tree property (BST property) if, for every node, the keys in its left subtree are smaller than its own key, and the keys in its right subtree are larger than its own key. It has the...

Program to tell if a singly linked list is circular.

Given a distributed system with many clients and many servers where the servers each export a different set of services and each have a different amount of computing power discuss the data structures used in a router to perform load balancing. </p...

Traverse a tree in preorder fashion