Data Structures

1. T R E E A Lecture by Abdul Ghaffar Khan

6. Parts of a Tree nodes

7. Parts of a Tree parent node

8. Parts of a Tree child nodes parent node

9. Parts of a Tree child nodes parent node

10. Parts of a Tree root node leaf nodes

11. Parts of a Tree sub-tree

12. Parts of a Tree sub-tree

13. Parts of a Tree sub-tree

17. Example: Preorder 31 43 64 20 40 56 28 33 47 59 89 43 31 20 28 40 33 64 56 47 59 89

19. Example: Inorder 31 43 64 20 40 56 28 33 47 59 89 20 31 28 40 33 43 56 47 59 64 89

21. Example: Postorder 31 43 64 20 40 56 28 33 47 59 89 20 28 40 31 33 56 47 59 64 89 43

23. Example: Expression Tree / + / 1 3 * 6 7 4 1/3 + 6*7 / 4

25. Example: Infix / + / 1 3 * 6 7 4 1 / 3 + * 6 7 / 4

26. Example: Postfix 7 / 1 + / 3 * 6 4 Recall: Reverse Polish Notation / / 1 1 3 3 6 6 7 7 * * 4 4 / / + +

27. Example: Prefix / + / 1 3 * 6 7 4 + / 1 3 / * 6 7 4

28. Breadth first first traversal 1, 2, 3, 4, 5, 6, 7, 8, 9 1 2 3 4 5 6 7 8 9

29. Depth first first traversal 1, 2, 5, 6, 3, 7, 4, 8, 9 1 2 3 4 5 6 7 8 9

31. Example 1: 31 43 64 20 40 56 28 33 47 59 89 key is an integer

33. Insert 31 43 64 20 40 56 28 33 47 59 89 Example: 57

34. Insert 31 43 64 20 40 56 28 33 47 59 89 Example: 57 57

36. Search 31 43 64 20 40 56 28 33 47 59 89 Example: 59 57 found

37. Search 31 43 64 20 40 56 28 33 47 59 89 Example: 61 57 failed

40. 4.4 AVL Trees 5 2 8 1 4 3 7 An AVL Tree 7 2 8 1 4 3 5 Not an AVL Tree