Traversing Ordered Rooted Trees in Discrete Math

Надежный VDS
3 Просмотры
Поддержите сайт и поделитесь материалом в соц.сетях:

Издатель
Ordered trees are a common way to organize information so that it may be searched, counted, and/or processed. Because of this, we need to understand the methods we can use to reliably move from vertex to vertex across the edges in a way so that every vertex is visited.

In this video, we study the basics of traversing a tree by looking at some examples including a simple application of the Huffman code, explaining the steps of preorder, inorder, and postorder traversal, and showing how these traversal methods can be applied to binary trees representing mathematical expressions.

Timestamps
00:00 | Intro
01:05 | Ordered rooted trees
02:36 | Traversing ordered rooted trees
06:13 | Huffman Code Trees
07:44 | Huffman code example
13:14 | Methods for traversing a tree
24:48 | Preorder, inorder, and postorder "shortcut"
31:29 | Using a binary tree to represent a mathematical expression
32:49 | Infix notation of an arithmetic expression
34:36 | HP-35 calculator with postfix notation
35:14 | Postfix notation of an arithmetic expression
37:48 | Prefix notation of an arithmetic expression
39:20 | Arithmetic example using prefix notation
40:32 | Arithmetic example using postfix notation

Image source of HP-35 calculator: https://commons.wikimedia.org/wiki/File:HP-35_Red_Dot.jpg#:~:text=Author-,Mister%20rf,-Licensing%5Bedit%5D
License: "CC BY-SA 4.0" https://creativecommons.org/licenses/by-sa/4.0
Date: 2 November 2019

Hashtags
#traverse #tree #order
Категория
Postfix
Комментариев нет.
Kwork.ru - услуги фрилансеров от 500 руб.