Woking-34 / dynamic-stackless-binary-tree-traversal

A novel algorithm for traversing a binary tree that does not require a stack and, unlike previous approaches, works with dynamic descent direction without restarting.

Home Page:https://software.intel.com/en-us/articles/dynamic-stackless-binary-tree-traversal

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Woking-34/dynamic-stackless-binary-tree-traversal Stargazers