What is the relationship between the number of leaf nodes (L) and the number of internal nodes (I) in a full binary tree?
L = 2 * I
L = I
L = I - 1
L = I + 1
Which data structure is most suitable for efficiently finding a path with a given sum in a Binary Tree?
Stack
Queue
Hash Set
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.
When deleting a node with two children in a BST, which node is typically chosen as its replacement?
The node's immediate parent
The leftmost child of the node's right subtree
The rightmost child of the node's left subtree
Any leaf node in the subtree rooted at the node being deleted
The diameter of a binary tree is defined as:
The longest path between any two nodes in the tree.
The height of the tree.
The number of nodes in the tree.
The shortest path between the root and any leaf node.
Is it possible for a full binary tree to have an even number of nodes?
Yes
No
Which data structure is most suitable for implementing Level Order Traversal efficiently?
Binary Heap
Linked List
Which type of binary tree has the strictest structure, requiring all levels to be completely filled and all leaf nodes to be at the same level?
Complete Binary Tree
Balanced Binary Tree
Full Binary Tree
Perfect Binary Tree
Which type of binary tree traversal is typically used to delete all nodes in a BST?
Level-order traversal
Inorder traversal
Preorder traversal
Postorder traversal
If a perfect binary tree has a height of 'h', how many nodes are present in the tree?
h^2
2^(h+1) - 1
2^h - 1
2h