If the height of a binary tree is 54, how many null pointers are there as children?(a) 1267(b) 3^58(c) 56(d) 2^55The question was asked by my college professor while I was bunking the class.My question is taken from Recursion topic in division Induction and Recursion of Discrete Mathematics

If the height of a binary tree is 54, how many null pointers are there

1.	If the height of a binary tree is 54, how many null pointers are there as children?(a) 1267(b) 3^58(c) 56(d) 2^55The question was asked by my college professor while I was bunking the class.My question is taken from Recursion topic in division Induction and Recursion of Discrete Mathematics
Answer» Correct option is (d) 2^55 The explanation is: Depth-first SEARCH (DFS) algorithm of a binary tree, is a trivial example of short-circuiting. We can have a standard RECURSIVE algorithm in CASE of DFS. Now, a perfect binary tree of HEIGHT h has 2^h+1 Null pointers as children. h = 54 2^54+1 2^55.

Discussion

No Comment Found

Related InterviewSolutions

If the height of a binary tree is 54, how many null pointers are there as children?(a) 1267(b) 3^58(c) 56(d) 2^55The question was asked by my college professor while I was bunking the class.My question is taken from Recursion topic in division Induction and Recursion of Discrete Mathematics
Every recursive algorithm must have the problem of ________(a) overhead of repeated function calls(b) collision of different function calls(c) searching for all duplicate elements(d) make only two recursive callsThis question was addressed to me in final exam.Question is from Recursion topic in chapter Induction and Recursion of Discrete Mathematics
Which of the following functions generates new data at each step of a method?(a) corecursive function(b) structural recursive function(c) unirecursive function(d) indirect functionThe question was asked during an internship interview.I want to ask this question from Recursion topic in section Induction and Recursion of Discrete Mathematics
In which of the following problems recurrence relation holds?(a) Optimal substructure(b) Tower of Hanoi(c) Hallmark substitution(d) Longest common subsequenceThis question was addressed to me in an interview for internship.The query is from Recursion in chapter Induction and Recursion of Discrete Mathematics
The argument of each recursive call is the content of a field of the original output. This definite characteristic belongs to which of the following function?(a) Structurally recursive function(b) Generativity recursive function(c) General function(d) Indirect recursive functionThe question was posed to me during an interview.The query is from Recursion in section Induction and Recursion of Discrete Mathematics
The mutual recursion is also termed as ______(a) indirect recursion(b) constructive recursion(c) generative recursion(d) definitive recursionI had been asked this question in a national level competition.Asked question is from Recursion topic in section Induction and Recursion of Discrete Mathematics
_______ recursion consists of multiple self-references.(a) binary recursion(b) single recursion(c) multiple recursion(d) coinductive recursionI got this question during an interview.I want to ask this question from Recursion in chapter Induction and Recursion of Discrete Mathematics
How many types of self-referential recursive data are there in computer programs?(a) 6(b) 2(c) 10(d) 4I had been asked this question in semester exam.This intriguing question originated from Recursion in division Induction and Recursion of Discrete Mathematics
________ is the consequence of dynamic programming.(a) Bellman equation(b) Frobenius equation(c) Linear equation(d) Boolean expressionThe question was asked in a job interview.My question comes from Recursion in portion Induction and Recursion of Discrete Mathematics
Which of the following is contained in a recursive grammar?(a) semantic rules(b) production rules(c) recursive language(d) recursive functionThe question was asked during an online interview.Question is from Recursion topic in division Induction and Recursion of Discrete Mathematics

If the height of a binary tree is 54, how many null pointers are there as children?(a) 1267(b) 3^58(c) 56(d) 2^55The question was asked by my college professor while I was bunking the class.My question is taken from Recursion topic in division Induction and Recursion of Discrete Mathematics

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment