Interview Bootcamp
Ask Author
Back to course home

0% completed

Vote For New Content
Binary Search Tree (BST)

Binary Search Tree (BST) - Definition and Characteristics

A Binary Search Tree (BST) is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. The BST follows a specific ordering property:

  • The left subtree of a node contains only nodes with values less than the node’s value.
  • The right subtree of a node contains only nodes with values greater than the node’s value.
  • This rule applies recursively to every node in the tree.

.....

.....

.....

Like the course? Get enrolled and start learning!