Which of the following is false about a binary search tree?

A The left child is always lesser than its parent
B The right child is always greater than its parent
C The left and right sub-should also be binary search trees
D Either the left of the right sub- tree should be be binary search tree but not both.

Correct Answer: Either the left of the right sub- tree should be be binary search tree but not both.

Bissoy MCQ
#তথ্য প্রযুক্তি #বাইনারি গণিত- Binary Math #Combined Bank (সমন্বিত ব্যাংক) #Assit. Programmer | Sonali Bank #BD Krishi Bank - 16.11.2018 #Rubali Bank

Related Questions

The popular notion that a tree's age can be determined by counting number of internal rings in its trunk is generally true. Howeevr, to help regulate the internal temperature of the tree, the outermost layers of wood of the Brazilian ash often →peel away when the temperature exceeds 95 degrees Fahrenheit, leaving the tree with fewer rings than it would otherwise have. So only if the temperature in the Brazilian ash's environment never exceeds 95 degrees Fahrenheit →elav eing the tree with fewer rings than it would otherwise have. So only if the reliable measure of the tree's age. Which of the following is an assumption on whish the argument above depends?
A The growth of new rings in a trees is not a function of levels of precipitation.
B Only the Brazilaian ash loses rings because of excessive heat.
C One day of temperatures above 95 degrees Fahrenheit will cause the Brazilian ash to lose one ring.
D The internal rings of all tress are of uniform thickness
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
A O(1)
B O(long)
C O(n)
D O(long)
Fill in the blank : I am writing to request that Google----web search censorship based on point of view. An unidentified Google spokesman has indicated that google may alter its search algorithms so as to, in effect, censor the views of the so called climate.
A extant
B repudiate
C foible
D pertain
The complexity of Binary search algorithm is ---
A O(n)
B O(log n)
C On(n2)
D O(n log n)
The complexity of Binary search algorithm is ___
A O (n)
B O (log n)
C O (n2)
D O ( n log n )
The time complexity of binary search is :
A constant
B quardratic
C exponential
D logarithmic
The complex of Binary search alogrithm is___
A O(n)
B O(log n)
C O(n2)
D O (n log n)
A binary adder is a logic circuit that can add _____ binary numbers at a time.
A Hundreds
B Thousands
C One
D Two
E None of the above
Complete Binary Tree যার height n, তার মধ্যে node কতটি?
A n
B 2n
C 2n+1
D 2n+1-1
Which of the following tree species in Chhattisgarh is included in nationalized tree list?
A Sal
B Teak
C Khair (Catechu)
D All of the above

Next steps