|
 What is heap sort? |
| How to reverse the odd bits of an integer? |
| Check if the 20th bit of a 32 bit integer is on or off? |
| How to reverse the bits in an interger? |
| What purpose do the bitwise and, or, xor and the shift operators serve? |
| Write a C program to count bits set in an integer? |
| What is a threaded binary tree? |
| Write pseudocode to add a new node to a Binary Search Tree (BST) |
| Implement Breadth First Search (BFS) and Depth First Search (DFS) |
| A full N-ary tree has M non-leaf nodes, how many leaf nodes does it have? |
| How many different trees can be constructed using n nodes? |
| What is an AVL tree? |
| How do you convert a tree into an array? |
| Given an expression tree, evaluate the expression and obtain a paranthesized form of the |
| Find the closest ancestor of two nodes in a tree. |
| Construct a tree given its inorder and preorder traversal strings. Similarly construct a tree given |
0 comments:
Post a Comment