![Binary Tree- Representation [array]
14
𝑺𝒊𝒛𝒆 − 𝑨𝒓𝒓𝒂𝒚 𝒏𝒐𝒅𝒆 𝒌 ⇒ 𝟐𝒌
− 𝟏 , 𝑘 ≥ 1
𝑘 ⇒ 𝑑𝑒𝑝𝑡ℎ](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-14-320.jpg)
![Binary Tree- Representation [Linked list]
15](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-15-320.jpg)
![Binary Tree- Traversing [Pre-Order]
17](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-17-320.jpg)
![Binary Tree- Traversing [In-Order]
18](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-18-320.jpg)
![Binary Tree- Traversing [Post-Order]
19](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-19-320.jpg)
![Binary Tree- Traversing [ Class Activity ]
20
• Pre-Order Root Left-sub-tree Right-sub-tree
• In-Order Left-sub-tree Root Right-sub-tree
• Post-Order Left-sub-tree Right-sub-tree Root](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-20-320.jpg)
![Type – [HEAP ]
26
1. Min Heap
Parent Node < child Node
2. Max Heap
Parent Node > child Node](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-26-320.jpg)
![Type – [ Max HEAP ]
27
Parent Node > child Node](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-27-320.jpg)
![Type – [ Min HEAP ]
28
Parent Node < child Node](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-28-320.jpg)
![[ Max HEAP ]-Example
29
Parent Node > child Node
1](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-29-320.jpg)
![[ Max HEAP ]-Example
30
1](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-30-320.jpg)
![[ Min HEAP ]-Example [ Class Activity ]
31
2](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-31-320.jpg)
![[ Min HEAP ]-Example [ Class Activity ]
32
2](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-32-320.jpg)
![[Delete Node]- [Max heap]
33](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-33-320.jpg)
![[Delete Node]- [Max heap]
34](https://image.slidesharecdn.com/dsalg-4-220312054143/85/Ds-alg-4-34-320.jpg)
(Ds+alg) 4
- 1. TREE 1 4 Prepared by: Mir Omranudin Abhar Email : MirOmran@Gamil.com Spring , 2019
- 2. 2 • Non-Linear Data Structure • Non- Primitive Data Structure • Dynamic Data Structure
- 3. Tree 3 از تهی غیر و متناهی ای مجموعه ی چندین یا ک node است
- 7. Tree – example-3 7 … … .… .. … … .… .. … … .… .. … … .… ..
- 9. Tree Representation -> Linked list 9
- 10. Tree Representation -> Linked list 10
- 11. Binary -Tree 11
- 12. Binary -Tree 12
- 13. Complete Binary -Tree 13 𝐦𝐚𝐱 𝒏𝒐𝒅𝒆 𝒊 ⇒ 𝟐𝒊−𝟏 , 𝑖 ≥ 1 𝒕𝒐𝒕𝒂𝒍 𝒏𝒐𝒅𝒆 𝒌 ⇒ 𝟐𝒌 − 𝟏 , 𝑘 ≥ 1 𝑖 ⇒ 𝑙𝑒𝑣𝑒𝑙 , 𝑘 ⇒ 𝑑𝑒𝑝𝑡ℎ
- 14. Binary Tree- Representation [array] 14 𝑺𝒊𝒛𝒆 − 𝑨𝒓𝒓𝒂𝒚 𝒏𝒐𝒅𝒆 𝒌 ⇒ 𝟐𝒌 − 𝟏 , 𝑘 ≥ 1 𝑘 ⇒ 𝑑𝑒𝑝𝑡ℎ
- 15. Binary Tree- Representation [Linked list] 15
- 16. Binary Tree- Traversing 16 • Pre-Order Root Left-sub-tree Right-sub-tree • In-Order Left-sub-tree Root Right-sub-tree • Post-Order Left-sub-tree Right-sub-tree Root
- 17. Binary Tree- Traversing [Pre-Order] 17
- 18. Binary Tree- Traversing [In-Order] 18
- 19. Binary Tree- Traversing [Post-Order] 19
- 20. Binary Tree- Traversing [ Class Activity ] 20 • Pre-Order Root Left-sub-tree Right-sub-tree • In-Order Left-sub-tree Root Right-sub-tree • Post-Order Left-sub-tree Right-sub-tree Root
- 21. Converting Algebraic expression into binary tree 21
- 22. Converting Algebraic expression into binary tree 22
- 23. Converting Algebraic expression into binary tree 23
- 24. Converting Algebraic expression into binary tree 24
- 25. HEAP 25 برای Implement کردن priority Queue میشود استفاده ها . نوع این در که عضوی هر Queue است اولویت ترین پائین یا باالترین میشود خارج ان از .
- 26. Type – [HEAP ] 26 1. Min Heap Parent Node < child Node 2. Max Heap Parent Node > child Node
- 27. Type – [ Max HEAP ] 27 Parent Node > child Node
- 28. Type – [ Min HEAP ] 28 Parent Node < child Node
- 29. [ Max HEAP ]-Example 29 Parent Node > child Node 1
- 30. [ Max HEAP ]-Example 30 1
- 31. [ Min HEAP ]-Example [ Class Activity ] 31 2
- 32. [ Min HEAP ]-Example [ Class Activity ] 32 2
- 33. [Delete Node]- [Max heap] 33
- 34. [Delete Node]- [Max heap] 34