Which Of The Following Is False About A Binary Search Tree #559
Which of the following is false about a binary search tree?
This multiple choice question (MCQ) is related to the book/course gs gs121 Data Structures and Algorithms. It can also be found in gs gs121 Binary Trees - Binary Search Tree - Quiz No.1.
Which of the following is false about a binary search tree?
The left child is always lesser than its parent
The right child is always greater than its parent
The left and right sub-trees should also be binary search trees
In order sequence gives decreasing order of elements
Similar question(s) are as followings:
Online Quizzes of gs121 Data Structures and Algorithms
Binary Trees - Binary Search Tree - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Binary Search Tree - Quiz No.2
gs gs121 Data Structures and Algorithms
Online Quizzes
Binary Trees - Preorder Traversal - Quiz No.1
gs gs121 Data Structures and Algorithms
Online Quizzes