Тёмный

Visual Post order depth first Tree Traversal 

HurrayBanana
Подписаться 6 тыс.
Просмотров 344
50% 1

A system that constructs and draws a BST structure and then uses image processing to generate an outline of the tree. After this post order lines are placed in each node drawn to the right of the node (post). A further line tracing algorithm algorithm has then followed the outline of the tree writing down each node value when the post order line is encountered. This is the same visual method we can use to perform a post order traversal of a BST.
This could be adapted to provide inorder and preorder lines for the the other variants of depth first traversal.

Опубликовано:

 

10 май 2022

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 2   
@ukcroupier
@ukcroupier 2 года назад
Interesting visualization. Instead of going up and down the tree structure this looks like it's a maze and you always take the path to your right.
@HurrayBanana
@HurrayBanana 2 года назад
because you need to hug the tree, so you are essentially not following directly the branches. Following the outline visual models the back tracking performed by recursively searching the tree. It's a clever visual approach
Далее
Python Selenium vs Python Playwright
2:37
Я ДРОЖАЛ ПОСЛЕ ЭТОГО...
16:24
Просмотров 627 тыс.
Height Of Binary Tree
6:35
Просмотров 96 тыс.
Why do Convolutional Neural Networks work so well?
16:30