Data Structures and Algorithms 2

 Q. Define Balance Factor.

Q. Define skewed binary tree.

Q. Define the term right skewed binary tree.

Q. The in-degree of the root node of a tree is always zero.

Q. Define heap tree.

Q. Define degree of the tree.

Q. How many nodes in a tree have no ancestors.

-Q. Construct the AVL Tree for the following data.

1) Chaitra, Magh, Vaishakh, Kartik, Falgun, Aashadh

2) SUN, FRI, MON, WED, TUE, THUR, SAT

3) Pen , Eraser, Book, Scale, Sketchpen, Crayon, Colorpencil

Q. Write the steps for creating BST for the following data.

22, 13, 4, 6, 25, 23, 20, 18, 7, 27.

Q. Traverse the following binary tree using preorder, postorder, inorder.

Q. Write a C function to compare two BST.

Q. Write a recursive 'C' function to count the total nodes in a BST.

Q. Write a non-recursive 'C' function to insert an element in a binary search tree.