JamesFlare/CSCI-1200
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update README.md

Browse Source 
added overview of lists vs trees vs graphs
This commit is contained in:
NehaKeshan
2023-10-27 09:03:42 -04:00
committed by GitHub
parent fea61ef5ae
commit abb1bad0e0
1 changed files with 5 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
lectures/17_trees_I/README.md
View File

@@ -11,6 +11,11 @@
- Implementation of ds_set class using binary search trees - Implementation of ds_set class using binary search trees
- In-order, pre-order, and post-order traversal - In-order, pre-order, and post-order traversal
## Overview: Lists vs Trees vs Graphs
- Trees create a hierarchical organization of data, rather than the linear organization in linked lists (and arrays and vectors).
- Binary search trees are the mechanism underlying maps & sets (and multimaps & multisets).
- Mathematically speaking: A _graph_ is a set of vertices connected by edges. And a tree is a special graph that has no _cycles_. The edges that connect nodes in trees and graphs may be _directed_ or _undirected_.
## 17.1 Definition: Binary Trees ## 17.1 Definition: Binary Trees
- A binary tree (strictly speaking, a “rooted binary - A binary tree (strictly speaking, a “rooted binary