Binary Tree Properties

  • Each node has at most 2 children
  • Left child < Parent < Right child (BST)
  • Perfect binary tree: all levels full
  • Complete: all levels full except possibly last
  • Height = log₂(n) when balanced

Decision Trees

  • Used in machine learning classification
  • Each node represents a decision/question
  • Leaves represent final classifications
  • Easy to interpret and visualize
  • Can handle both numeric and categorical data