Please can someone tell me the correct answer for question 1 and 2? It is C prog

Question

Please can someone tell me the correct answer for question 1 and 2? It is C programming...

A binary tree is a binary search tree if in the path from the root to every leaf node, the key of each node is greater than (or equal to) the key of its parent. every non-leaf node has children whose key values are less than (or equal to) the parent. every node has exactly two children. every left child has a key less than the parent and every right child has a key greater than the parent. The binary search tree property states that: For each node x, every key found in the left subtree of x is less than the key of x. For each node x, x's key is greater than the keys in either subtree. For each node x, every key found in the right subtree of x is greater than the key of x. 1 and 3 2 and 3

Explanation / Answer

1. every left child has a key less than the parent and right child has a key greater than the parent

It is the basic criteria that is employed in a binary search tree and it is called ordered binary tree if it is satisfied.

2.4) 1 and 3

These two are the rules that are to be satisfied in binary search tree.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---