Rajiv's Programming Notes
Trees
Initializing search
    rajivharlalka/notes
    rajivharlalka/notes
    • Home
      • 2023 05 25
      • 2023 06 05
      • Self Hosting 101
      • Rust
      • Reading
        • Reading
        • Decode json with proper types
        • Gotcha
        • Reading
      • Command Line
      • Desktop Managers
      • Nginx
      • SSH
      • BRIN Index
      • Configuration guidelines
      • General resources
      • Important SQL
      • PostgreSQL
      • Query Planner
      • Types of Indexes
      • Users and Security
      • Using Docker
      • WAL
      • Functions
      • Reading
        • Additional IO Observability in Postgres with pg stat io
        • Row Estimates
      • Countty
      • Dotfiles
      • Fonts
      • Monitor Search
      • Second Brain
        • Algorithms
        • Bellman Ford
        • Dijkstra's Algo
        • Graphs
        • Kadane's Algorithm
        • Kahn's Algo
        • Trees
        • Union Find
        • The TTY demystified
        • University of Threads > Product Management

    Trees

    • simple graph with

      • n nodes, all pairs connected with n-1 edges
      • only one simple path exists between any pair of nodes.
      • 1 connected components, no cycle.
    • Rooted

    • unrooted
    Made with ❤️ by Rajiv.
    Made with Material for MkDocs