Trees and Graphs

What is the preorder traversal of the given binary tree?

• A B D E H I J K L C F G

• A B D H I E J K C F L G

• H D I B J E K A L F C G

• H I D J K E B L F G C A

What is the postorder traversal of the given binary tree?

• H D I B J E K A L F C G

• H I D J K E B L F A C G

• H I D J K E B L F G C A

• A B C D H I E J K F L G

What is LR Rotation?

• Inserted node is in the left subtree of left subtree of node A

• Inserted node is in the right subtree of right subtree of node A

• Inserted node is in the right subtree of left subtree of node A

• Inserted node is in the left subtree of the right subtree of node A

What is an AVL tree?

• a tree which is balanced and is a height balanced tree

• a tree which is unbalanced and is a height balanced tree

• a tree with three children

• a tree with atmost 3 children

Why do we need AVL tree?

• To save memory

• To avoid formation of skewed trees

• To simplify storing

• To attain faster memory access

Which of the following is TRUE?

• The cost of searching an AVL tree is θ(log n) but that of a binary search tree can be O(n)

• The cost of searching an AVL tree is θ(log n) but that of a complete binary tree is θ(n log n)

• The cost of searching a binary search tree is O(log n ) but that of an AVL tree is θ(n)

• The cost of searching an AVL tree is θ(n log n) but that of a binary search tree is O(n)

Which rotation is required in the given AVL tree?

• LL Rotation

• RR Rotation

• LR Rotation

• RL Rotation

What is the balance factor of any node in AVL tree?

• Height of right subtree - Height of left subtree

• Height of left subtree - Height of right subtree

• Level number of right subtree - Level number of left subtree

• Level number of left subtree - Level number of right subtree

A tree is composed of ____ connected by edges or lines.

• Fruit 
• Leaf Node
• Root Node
• Nodes

There are two types of data structures, they are

• Static and dynamic

• Fast and slow

• Large and small

• Ascending and descending