| 0 |
| Can you construct a tree using postorder and preorder traversal?Write C code for iterative preorder, inorder and postorder tree traversals |
| Write C code to count the number of leaves in a tree |
| Write C code to search for a value in a binary search tree (BST). |
| Write a C program to delete a node from a Binary Search Tree? |
| Write C code to implement level order traversal of a tree. |
| Write C code to check if a given binary tree is a binary search tree or not? |
| Write a C program to create a copy of a tree |
| Write C code to implement the preorder(), inorder() and postorder() traversals. Whats their time |
| Write C code to return a pointer to the nth node of an inorder traversal of a BST. |
| Write a C program to create a mirror copy of a tree (left nodes become right and right nodes |
| Write a C program to compute the maximum depth in a tree? |
| Write a C program to find the mininum value in a binary search tree. |
| Write C code to determine if two trees are identical |
| Write a C program to delete a tree (i.e, free up its nodes) |
| Write a C program to determine the number of elements (or size) in a tree. |
| Write a C program to find the depth or height of a tree. |
| Write your own trim() or squeeze() function to remove the spaces from a string. |
| Write a program to print numbers from 1 to 100 without using loops! |
| How to generate prime numbers? How to generate the next prime after a given prime? |
| How to add two numbers without using the plus operator? |
| Write a program to check if the stack grows up or down |
| Write a program to merge two arrays in sorted order, so that if an integer is in both the arrays, it |
| Given two strings A and B, how would you find out if the characters in B were a subset of the |
| How can we sum the digits of a given number in single statement? |
| Write code to round numbers |
| Write a program to have the output go two places at once (to the screen and to a file also) |
| How do you find out if a machine is 32 bit or 64 bit? |
| Is there a way to multiply matrices in lesser than o(n^3) time complexity? |
| Write a simple piece of code to split a string at equal intervals |
0 comments:
Post a Comment