Note 1

Take a note while surfing.

Give your Note a Colorful Tag.

Stay on same information and in Sync wherever you are.

Note 2

Organize your information,It may take Shape.

Differ your Content by Color.

Easy to pull up your content from anywhere anytime.

Note 3

Don't Let information to miss,Because it take shape

Simple an Easy Way to take a note.

Get the same in next visit.

1. What are the number of nodes of left and right subtree of the binary tree if the data is inserted in the following order: 45, 15, 8, 5 6, 5, 65, 47, 12, 18, 10, 73, 50, 16, 61

2. Consider the following code segment in C to traverse a binary tree using the preorder

typedef struct tree {

int info;

struct *left;

struct *right;

}node;

void preorder(node *tree)

{

if (t)

{

Statementl

Statement2

Statement3

}

}

The above Statements should be

3. The worst case time complexity of AVL tree is better in comparison to binary search tree for

4. A full binary tree with 2n+1 nodes contain

5. If a node in a BST has two children, then its inorder predecessor has

6. A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as

7. A full binary tree with n leaves contains

8. The number of different directed trees with 3 nodes are

9. One can convert a binary tree into its mirror image by traversing it in

10. The number of leaf nodes in a complete binary tree of depth d is