The Baeldung logo
  • The Baeldung LogoCS SublogoCS Sublogo
  • Start Here
  • Guides ▼▲
    • Core Concepts

      Fundamental concepts in Computer Science

    • Operating Systems

      Learn about the types of OSs used and the basic services they provide.

    • Artificial Intelligence

      Explore the concepts and algorithms at the foundation of modern artificial intelligence

    • Graph Theory

      Learn how GPS systems find the shortest routes, how engineers design integrated circuits and more real-world uses of graphs

    • Latex

      A powerful preparation tool for creating high-quality document.

  • Pricing
  • About ▼▲
    • Full Archive

      The high level overview of all the articles on the site.

    • About Baeldung

      About Baeldung.

Category upGraph Theory

Trees

In graph theory, a tree is a graph where two nodes are connected by one edge. Trees are a simple graph form because there are no cycles. Despite this, trees are used to solve various problems in computer science.

  • Binary Tree (32)
  • Complexity (7)
  • Red-Black Trees (4)
  • DFS (3)
  • Definition (2)
  • Hashing (2)
  • Kruskal (2)
  • Prim (2)
  • BFS (2)

>> Prim’s Algorithm

  • reference

>> Tree Edit Distance

>> Applications of Red-Black Trees

>> B-tree Data Structure

>> Balanced Trees

>> Rank of a Node in a Binary Search Tree

>> Finding the In-Order Successor of a Node

>> From Lists to Forests

>> Hashing a Tree Structure

>> Real World Examples of Tree Structures

  • «
  • ← Previous
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • Next →
The Baeldung logo

Categories

  • Algorithms
  • Artificial Intelligence
  • Core Concepts
  • Data Structures
  • Latex
  • Networking
  • Security

Series

  • Graphs Tutorial
  • Neural Networks Series
  • LaTeX Series

About

  • About Baeldung
  • Baeldung All Access
  • The Full archive
  • Editors
  • Our Partners
  • Partner with Baeldung
  • eBooks
  • FAQ
  • Baeldung Pro
  • Terms of Service
  • Privacy Policy
  • Company Info
  • Contact
The Baeldung Logo