Results for postorder

Bare minimum postgres work queue

Walk or map over objects in a depth-first preorder or postorder manner.

[unist](https://github.com/syntax-tree/unist) utility to create a new tree by mapping all nodes in postorder traversal with a given function.

Adds possibility to import YAML files in serverless.yaml config file

Helpers for traversing, inspecting, and transforming arbitrary trees.

n-ary tree implementation in JavaScript(TypeScript).

Walk objects like this guy.

client module to access switchains's api

Playground to try out algorithms around BST

[![NPM version][npm-image]][npm-url] [![npm download][download-image]][download-url] [![ci][ci-image]][ci-url]

Integration for Zygote and Active Campaign

A simple binary search tree

A simple engine to build webapps

use js to describe datastructure

The Typescript SDK for DeltaDeFi protocol

[](https://www.npmjs.com/package/@itpropro/tree-structure-ts)  [![ci](https://github.c

This is an implementation of balanced binary search tree with pretty print.

TypeScript library for automating Polymarket workflows from Node.js. The main use case is straightforward: load a market from Gamma, post an order to CLOB, and wait for the final confirmation state.

🚀 Complete TypeScript Data Structures Library: Linked List, Hash Map, Concurrent HashMap, Stack, Queue, Set, Tree, BST, AVL Tree, Red-Black Tree, Graph, Heap, Trie with 100% test coverage, async-safe operations, and comprehensive algorithms. Perfect for

The Node.js library for OKEx V3 API.

Implementation of the most common data structures in Javascript

This library provides support for traversing objects and their values while providing information on the traversal state, pathing to target values, and the ability to manipulate said pathing to easily move to related values.

Node for algorithm

My custom made binary-search-tree module.