Perfect binary trees are commonly used in which of the following applications due to their balanced structure and efficient space utilization?
Heap Sort
Hash Tables
Trie Data Structures
Binary Search Trees
A full binary tree with 'k' internal nodes has how many total nodes?
k + 1
2k
k
2k + 1
What is the worst-case time complexity of inserting a node into a Binary Search Tree (BST)?
O(n)
O(1)
O(n log n)
O(log n)
What is the maximum number of nodes at level 'l' in a binary tree?
2^l
l
2l
l^2
Which of the following statements is true about AVL trees?
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.
AVL trees guarantee a maximum height difference of 1 between the left and right subtrees of any node.
What is the difference between the height and depth of a node in a binary tree?
Height is always one more than the depth of a node.
Height is the number of edges from the root to the node, while depth is the number of nodes from the root to the node.
Height and depth are the same thing.
Height is the number of edges from the node to the deepest leaf, while depth is the number of edges from the root to the node.
What is the output of Preorder Traversal for the following Binary Tree: 1(2(4,5),3)?
1 2 4 5 3
4 5 2 3 1
4 2 5 1 3
1 3 2 4 5
Given a serialized representation of a Binary Tree, can we reconstruct the original tree uniquely?
No, never
Yes, always
Only if the tree is a BST
Only if we have additional information about the tree structure
What is the advantage of using a level order serialization for a Binary Tree?
Easier to implement than other serialization methods
More efficient for finding the LCA
Reduced space complexity
Preserves the level order traversal of the tree
Is it possible for a full binary tree to have an even number of nodes?
No
Yes