Question 243 – Binary-Trees
April 23, 2024Question 17376 – NTA UGC NET Dec 2023 Paper-2
April 23, 2024Question 8591 – Binary-Trees
Which of the following statements about the following binary tree is FALSE
Correct Answer: A
Question 56 Explanation:
A binary search tree is a rooted binary tree, whose internal nodes each store a key (and optionally, an associated value) and each have two distinguished sub-trees, commonly denoted left and right.
The tree additionally satisfies the binary search property, which states that the key in each node must be greater than or equal to any key stored in the left sub-tree, and less than or equal to any key stored in the right sub-tree.
Only option A is false
The tree additionally satisfies the binary search property, which states that the key in each node must be greater than or equal to any key stored in the left sub-tree, and less than or equal to any key stored in the right sub-tree.
Only option A is false
It is a binary serach tree
It is a complete binary tree
Nodes ‘J’ and ‘K’ are siblings
Node ‘B’ is the ancestor of node ‘J’
Subscribe
Login
0 Comments