awesome-repositories.com
Blog
awesome-repositories.com

Entdecke die besten Open-Source-Repositories mit KI-gestützter Suche.

EntdeckenKuratierte SuchenOpen-Source-AlternativenSelf-hosted SoftwareBlogSitemap
ProjektÜber unsRanking-MethodikPresseMCP-Server
RechtlichesDatenschutzAGB
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

1 Repo

Awesome GitHub RepositoriesLevel-Order Pointers

Techniques for linking nodes to their successors across different levels of a tree.

Distinct from Sibling Insertions: Focuses on creating pointers for traversal rather than inserting nodes into the structure.

Explore 1 awesome GitHub repository matching software engineering & architecture · Level-Order Pointers. Refine with filters or upvote what's useful.

Awesome Level-Order Pointers GitHub Repositories

Finde die besten Repos mit KI.Wir suchen mit KI nach den am besten passenden Repositories.
  • chanda-abdul/several-coding-patterns-for-solving-data-structures-and-algorithms-problems-during-interviewsAvatar von Chanda-Abdul

    Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews

    4,129Auf GitHub ansehen↗

    This repository is a curated guide and implementation library of coding patterns used to solve data structures and algorithms problems. It serves as a technical interview study resource, providing a comprehensive set of strategies and computational logic examples for optimizing time and space complexity. The project focuses on standardized algorithmic patterns, including sliding windows, two pointers, and dynamic programming. It features specific implementations for a wide range of challenges, such as LeetCode problem solutions and specialized techniques like cyclic sort and bitwise XOR opera

    Implements sibling and successor node linking across tree levels.

    algorithmscoding-interviewsdata-structures
    Auf GitHub ansehen↗4,129
  1. Home
  2. Software Engineering & Architecture
  3. Linked Lists
  4. Node Insertion Techniques
  5. Sibling Insertions
  6. Level-Order Pointers