Which of the following is incorrect with respect to binary trees?
A. Let T be a binary tree. For every k ≥ 0, there are no more than 2k nodes in level k
B. Let T be a binary tree with λ levels. Then T has no more than 2λ – 1 nodes
C. Let T be a binary tree with N nodes. Then the number of levels is at least ceil(log (N + 1))
D. Let T be a binary tree with N nodes. Then the number of levels is at least floor(log (N + 1))
Answer: Option D
This Question Belongs to Data Structure >> Binary Search Trees(B Tree)
A. O(1)
B. O(log n)
C. O(n)
D. O(n log n)
Which traversal method of a BST will produce a sorted sequence of node values?
A. Inorder
B. Preorder
C. Postorder
D. Level-order
What is the maximum number of children a node in a Binary Search Tree (BST) can have?
A. 1
B. 2
C. 3
D. Any number
How can you determine if a Binary Tree is a Binary Search Tree (BST)?
A. Verify if all nodes in the left subtree are less than the root and all nodes in the right subtree are greater than the root.
B. Check if the tree is balanced.
C. Ensure all nodes have exactly two children.
D. Verify the height of the tree.
Join The Discussion