{"id":23525713,"url":"https://github.com/ranaessam03/nonlinear_structures","last_synced_at":"2025-05-14T08:12:42.970Z","repository":{"id":166205644,"uuid":"635230027","full_name":"RanaEssam03/Nonlinear_Structures","owner":"RanaEssam03","description":"This repository contains implementations of Binary Search Trees, AVL Trees, and Heap Trees in cpp","archived":false,"fork":false,"pushed_at":"2023-05-13T22:40:32.000Z","size":811,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-17T01:45:36.471Z","etag":null,"topics":["avl-tree","bstree","heapsort-algorithm","tree"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/RanaEssam03.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-05-02T08:46:48.000Z","updated_at":"2023-07-22T14:11:07.000Z","dependencies_parsed_at":"2023-06-27T17:01:53.836Z","dependency_job_id":null,"html_url":"https://github.com/RanaEssam03/Nonlinear_Structures","commit_stats":null,"previous_names":["ranaessam03/nonlinear_structures"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RanaEssam03%2FNonlinear_Structures","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RanaEssam03%2FNonlinear_Structures/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RanaEssam03%2FNonlinear_Structures/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/RanaEssam03%2FNonlinear_Structures/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/RanaEssam03","download_url":"https://codeload.github.com/RanaEssam03/Nonlinear_Structures/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254101553,"owners_count":22014908,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["avl-tree","bstree","heapsort-algorithm","tree"],"created_at":"2024-12-25T19:11:57.748Z","updated_at":"2025-05-14T08:12:37.963Z","avatar_url":"https://github.com/RanaEssam03.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Trees Implementation\n\nThis repository contains implementations of various types of trees, including Binary Search Trees (BST), AVL Trees, Heaps and other types of Trees. Each implementation is written in a different programming language, including C++, Java, Python and more.\n\n## Binary Search Trees (BST)\n\nA binary search tree is a binary tree data structure in which the value of the left child of any node in the tree is less than or equal to the value of the node, and the value of the right child is greater than or equal to the value of the node. In this repository, you will find implementations of BSTs in various programming languages.\n\n## AVL Trees\n\nAn AVL tree is a self-balancing binary search tree in which the heights of the left and right subtrees of any node differ by at most one. The implementation of AVL Trees in this repository also includes methods for rotations and rebalancing.\n\n## Heaps\n\nA heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. The implementation of heaps in this repository includes both max and min heaps.\n\n\n## Usage\n\nEach implementation is contained in its own directory and includes instructions on how to compile and run the code. Simply navigate to the directory of the implementation you are interested in and follow the instructions.\n\n## Contributing\n\nIf you would like to contribute to this repository, please feel free to submit a pull request. Before doing so, please make sure that your code follows the coding standards and guidelines.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Franaessam03%2Fnonlinear_structures","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Franaessam03%2Fnonlinear_structures","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Franaessam03%2Fnonlinear_structures/lists"}