Which of the following statements is true about AVL trees?
AVL trees guarantee a maximum height difference of 1 between the left and right subtrees of any node.
AVL trees do not require any rotations to maintain balance.
AVL trees are a type of Red-Black tree.
AVL trees are always perfectly balanced.
Which data structure is most suitable for implementing Level Order Traversal efficiently?
Queue
Stack
Linked List
Binary Heap
What is the difference between Postorder and Inorder Traversal?
Postorder visits the left subtree, then the right subtree, and finally the root, while Inorder visits the left subtree, the root, and then the right subtree.
There is no significant difference; both traversals produce the same output.
Postorder is used for deleting nodes in a Binary Tree, while Inorder is used for printing the nodes in sorted order.
Postorder visits the root node before its children, while Inorder visits the root between its left and right children.
Which data structure is most suitable for efficiently finding a path with a given sum in a Binary Tree?
Heap
Hash Set
Which data structure is commonly used to efficiently implement priority queues due to the properties of complete binary trees?
What is the relationship between the depth of a node and its index in an array-based representation of a complete Binary Tree?
Depth = Index / 2
Depth = log2(Index + 1)
Depth = Index
Depth = 2 * Index
A full binary tree with 'k' internal nodes has how many total nodes?
2k + 1
k
k + 1
2k
A complete binary tree with 'n' nodes has a height of?
n - 1
n/2
floor(log2(n))
log2(n) + 1
If a perfect binary tree has a height of 'h', how many nodes are present in the tree?
2^h - 1
2^(h+1) - 1
2h
h^2
Which data structure is used in the iterative implementation of Preorder Traversal?