A binary tree is called perfectly balanced, if each node has a left and a right subtree in which the number of nodes differ by at most
A binary tree is called perfectly balanced, if each node has a left and a right subtree in which the number of nodes differ by at most
- 3
- 2
- 1(correct answer)
- 0
Answer and explanation
Correct answer: C - 1
A perfectly balanced tree (Wirth's definition) is one where, for each node, the numbers of nodes in the left and right subtrees differ by at most 1.
Practice for these exams
-
CUSAT CAT M.Sc. Forensic Science
-
Uttarakhand Judicial Services
Related question papers
Related exam syllabi
More solved explanations in Computer fundamentals
- Upon switching off the power the type of memory that readily loses data is classified as-
- In IBM i database terminology, which of these contains the actual data records?
- Which input device captures a digital image of a paper drawing or a page of printed text?
- Which of these is an ancient manual counting frame used for arithmetic?
- IC chip of computer is made up of -