Tuesday, May 3, 2022

Question 68 : What is binary search tree?

 A binary search tree is a special type of binary tree which have the following properties.

  • Nodes that are smaller than the root will be in the left subtree.
  • Nodes that are greater than the root will be the right subtree.
  • It should not have duplicate nodes
  • Both left and right subtree also should be binary search trees.

Don't miss the next article! 

Be the first to be notified when a new article or Kubernetes experiment is published.                            


 Share This

You may also like

Kubernetes Microservices
Python AI/ML
Spring Framework Spring Boot
Core Java Java Coding Question
Maven AWS