Give an algorithm for printing the level order data in reverse order. Add Comment Edit package in.blogspot.arunj2ee.ds.tree.binary.que; import in.blogspot.arunj2ee.ds.tree.BinaryTreeNode; import in.blogspot.arunj2ee.ds.tree... Read More
Give an algorithm for deleting the tree Add Comment Edit package in.blogspot.arunj2ee.ds.tree.binary.que; import in.blogspot.arunj2ee.ds.tree.BinaryTreeNode; import in.blogspot.arunj2ee.ds.tree... Read More
Give an algorithm for finding the number of nodes in a binary tree non-recursively Add Comment Edit package in.blogspot.arunj2ee.ds.tree.binary.que; import in.blogspot.arunj2ee.ds.tree.BinaryTreeNode; import in.blogspot.arunj2ee.ds.tree... Read More
Give an algorithm for finding the number of nodes in a binary tree recursively Add Comment Edit package in.blogspot.arunj2ee.ds.tree.binary.que; import in.blogspot.arunj2ee.ds.tree.BinaryTreeNode; import in.blogspot.arunj2ee.ds.tree... Read More
Give an algorithm for inserting an element into binary tree in recersive way 1 Comment Edit package in.blogspot.arunj2ee.ds.tree.binary.que; import in.blogspot.arunj2ee.ds.tree.BinaryTreeNode; import in.blogspot.arunj2ee.ds.tree... Read More
Give an algorithm for inserting an element into binary tree in non-recersive way Add Comment Edit package in.blogspot.arunj2ee.ds.tree.binary.que; import in.blogspot.arunj2ee.ds.tree.BinaryTreeNode; import in.blogspot.arunj2ee.ds.tree... Read More
Given a large file that does not fit in memory (say 10GB), find the top 100000 most frequent phrases. Add Comment Edit Given a large file that does not fit in memory (say 10GB), find the top 100000 most frequent phrases. The file has 50 phrases per line sepa... Read More
Write an efficient algorithm to find K-complementary pairs in a given array of integers. 1 Comment Edit Write an efficient algorithm to find K-complementary pairs in a given array of integers. Given Array A, pair (i, j) is K- complementary if ... Read More
Write an efficient algorithm to check if a string is a palindrome Add Comment Edit Write an efficient algorithm to check if a string is a palindrome. A string is a palindrome if the string matches the reverse of string. E... Read More