Skip to main content
C C++ Java Python PHP C# HTML CSS JavaScript Bootstrap Node.js Express.js React.js Next.js Tailwind TypeScript Dart Angular Vue.js Spring Boot Django Flask ASP.NET Material UI Chakra UI Sass MongoDB MySQL Oracle C C++ Java Python PHP C# HTML CSS JavaScript Bootstrap Node.js Express.js React.js Next.js Tailwind TypeScript Dart Angular Vue.js Spring Boot Django Flask ASP.NET Material UI Chakra UI Sass MongoDB MySQL Oracle
SQL Server Firebase PostgreSQL MariaDB Swift Kotlin React Native R Julia Scala NLP ML DP NN Gen AI JUnit Jest Pytest Selenium Cypress AWS Azure Google Cloud Stack Queue Linked List Trees Graphs SQL Server Firebase PostgreSQL MariaDB Swift Kotlin React Native R Julia Scala NLP ML DP NN Gen AI JUnit Jest Pytest Selenium Cypress AWS Azure Google Cloud Stack Queue Linked List Trees Graphs
Advanced 14 planned topics Algorithms

Introduction to Trees

Learn binary trees, BST, and traversals. Free trees introduction for DSA.

Learning Outcomes

  • Define root, leaf, height, and depth
  • Traverse a binary tree in the four common orders
  • Search and insert in a BST
  • Know why unbalanced BSTs degrade to lists

Overview

Trees organize hierarchical data. Binary trees and binary search trees are the interview default.

This page covers traversals (inorder, preorder, postorder, level order) and BST search.

Balanced trees come after the basics.

What this course will cover

  1. 1. Terminology
  2. 2. Traversals
  3. 3. BST
  4. 4. Recursion on trees
  5. 5. Level order
  6. 6. Practice

Start a complete tutorial now

Full 6-level lessons are live for C, C++, Java, Python, and JavaScript. Use them while the remaining Trees lessons are added.

← All technology tutorials