BST Property and Why It Matters in DSA Javascript - Build from Scratch

BST Property and Why It Matters

📖 Scenario: Imagine you are organizing a collection of books by their unique ID numbers. You want to store them so that searching for a book by its ID is very fast. A Binary Search Tree (BST) helps you do this by keeping books in a special order.

🎯 Goal: You will build a simple Binary Search Tree (BST) with three nodes and then print the tree structure to see how the BST property keeps the data organized.

📋 What You'll Learn

Create three nodes with values 10, 5, and 15

Link the nodes to form a BST where 5 is left child of 10 and 15 is right child of 10

Print the tree nodes in order: left child, root, right child

💡 Why This Matters

🌍 Real World

BSTs are used in databases and file systems to quickly find data by keeping it sorted.

💼 Career

Understanding BSTs helps in software development roles that involve data storage, search optimization, and algorithm design.

1

Create BST nodes

Create three variables called root, leftChild, and rightChild with values 10, 5, and 15 respectively.

DSA Javascript

# Your code here

Hint

Use const to create variables and assign the exact numbers.

2

Link nodes to form BST

Create an object called bst with properties value, left, and right. Set value to root, left to leftChild, and right to rightChild.

DSA Javascript

const root = 10;
const leftChild = 5;
const rightChild = 15;

# Your code here

Hint

Create an object with keys value, left, and right using the variables from Step 1.

3

Write function to print BST in order

Write a function called inOrderPrint that takes a node object and prints its left child, then its value, then its right child. Use console.log to print values.

DSA Javascript

const root = 10;
const leftChild = 5;
const rightChild = 15;

const bst = {
  value: root,
  left: leftChild,
  right: rightChild
};

# Your code here

Hint

Print left child first, then value, then right child using console.log.

4

Print the BST nodes in order

Call the function inOrderPrint with the bst object to print the nodes in order.

DSA Javascript

const root = 10;
const leftChild = 5;
const rightChild = 15;

const bst = {
  value: root,
  left: leftChild,
  right: rightChild
};

function inOrderPrint(node) {
  if (node.left !== null) {
    console.log(node.left);
  }
  console.log(node.value);
  if (node.right !== null) {
    console.log(node.right);
  }
}

# Your code here

Hint

Call inOrderPrint(bst); to see the nodes printed in order.