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

Options

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-trees should also be binary search trees

D : In order sequence gives decreasing order of elements

Click to view Correct Answer

Previous || Next

Data Structure Binary Search Tree more questions

Which among the following is incorrect about the anatomy of....

Consider an N-bits ADC (Analog to Digital Converter) whose analog....

The big-endian format is one in which

The addition of open loop zero pulls the root loci....

Mitral valve is present between which of the following?

What happens to the length of the commutators with the....

Which of the following is true for LEDs

Which of the following is untrue about Ab initio prediction?

Which is the only breeding colony of the flamingos in....

An electrical signal can be represented in either Thevenin form....

Data Structure Adjacency List more Online Exam Quiz

Data Structure Assessment

Data Structure Avl Tree

Data Structure Balanced Partition

Data Structure Binary Heap

Data Structure Binary Search Iterative

Data Structure Binary Tree Properties

Data Structure Binary Trees Array

Data Structure Binary Trees Linked Lists

Data Structure Binomial Fibonacci Heap

Data Structure Bit Array