DSA in Java covers a wide range of algorithms, including sorting algorithms, searching algorithms, graph algorithms, and dynamic programming algorithms. The implementation and optimization of these algorithms require a solid understanding of data structures, such as arrays, linked lists, trees, and graphs, and their associated operations.

Traversing Trees in constant space!!

A few Data Structures and Algorithms

:hotsprings: Data structures, algorithms and problem solving patterns using JavaScript.

No description provided.

Just for learning purpose

This is a simple Go program that checks if a given tree is complete or not. A tree is complete if all levels are completely filled except possibly the last level and the last level has all keys as left as possible.

Application which does a Linux Path Traversal in memory.

This is a Python script I made in November 2024 to get practice with tree traversals and binary decoding. It decodes a sequence of binary through a Huffman algorithm and returns the original encoded sequence

Implementation of all BST traversals and tree cloning

This is a Go program for creating a complete tree using linked list. You can easily insert nodes to the tree and print it. This library provide two inserting functions. One of them is for inserting nodes to the tree by filling the tree from left to right in per row. and the next one is to insert to left side of the tree.

Pre, post, and in order traversals of a binary search tree. Each node's key is a character and stores strings that begin with that character.

This repository consist of various Data Structure and my Quiz Problem solution in python

All you need to know about your coding interview includes algorithms, data structure, oops, design patterns, recursion, graph theory, tree traversal, combinatorial problems.

This is a simple Go program that traverses a tree in different ways. (Pre-order, In-order, Post-order, and Level-order)

Attempts at building things in Python. GUIs, tree traversal, games, etc.

The software for the satellite to rebuild the tree from the traversals.

A command line tool to calculate the difference between two data structures. Runs from the command line, compares two configuration files and shows a difference. Working with JSON and YAML. Provides output in stylish, plain and json format.

Java implementation of a binary search tree supporting standard operations such as insertion, deletion, and traversal. Includes balancing and node management.

BinarySearchTree with function such as Pre-Order, In-Order and Post-Order Traversal, and isBinarySearchTree

Tree traversal in React Js to work on family tree