search

zrwusa / data-structure-typed

Javascript Data Structure & TypeScript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree, AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue, Stack.
https://data-structure-typed-docs.vercel.app
MIT License
114 stars 8 forks source link

subTreeTraverse is unnecessary, since the dfs method can substitute it. #67

Closed zrwusa closed 8 months ago

zrwusa commented 8 months ago

Describe the solution you'd like subTreeTraverse is unnecessary, since the dfs method can substitute it.

 tree.addMany([4, 2, 6, null, 1, 3, null, 5, null, 7]);
    expect(tree.subTreeTraverse(node => node.key, tree.getNode(6), IterationType.ITERATIVE)).toEqual([6, 3, 7]);

Describe alternatives you've considered

tree.addMany([4, 2, 6, null, 1, 3, null, 5, null, 7]);
    expect(tree.dfs(node => node.key, 'pre', tree.getNode(6), IterationType.ITERATIVE)).toEqual([6, 3, 7]);
zrwusa commented 8 months ago

Has been removed in version 1.50.0