Given a serialized representation of a Binary Tree, can we reconstruct the original tree uniquely?
Only if we have additional information about the tree structure
Only if the tree is a BST
Yes, always
No, never
When performing a search for a value in a BST, what happens if the value is not found?
An error is raised.
The search continues indefinitely.
The closest value in the BST is returned.
A null pointer or a special value indicating the absence of the value is returned.
Red-Black trees introduce the concept of 'color' to nodes (red or black). What is the primary purpose of this color scheme?
To enforce a specific order of nodes during insertion
To maintain a relaxed form of balance, allowing for faster insertion and deletion compared to strictly balanced trees
To simplify the visualization of the tree structure
To enable efficient searching for nodes based on their color
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 node to the deepest leaf, while depth is the number of edges from the root to the 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.
What is the time complexity of finding the LCA in a Binary Search Tree (BST) in the worst case?
O(n)
O(n log n)
O(log n)
O(1)
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
What is the time complexity of finding all root-to-leaf paths in a Binary Tree?
O(n^2)
What is the output of Preorder Traversal for the following Binary Tree: 1(2(4,5),3)?
1 3 2 4 5
4 2 5 1 3
4 5 2 3 1
1 2 4 5 3
Which of the following is a common application of Binary Tree serialization?
Sorting data
Implementing a hash table
Storing and retrieving trees in a file or database
Finding the shortest path in a graph