A binary tree
- 1. Binary Search Trees By Asseged Fikru
- 2. btrees - 2 Outlines • Tree • Binary Search Tree • Traversal
- 3. btrees - 3 Tree Tree Each node can have 0 or more children on tree Binary tree • Tree with 0–2 children per node
- 4. btrees - 4 A binary search tree (BST) A binary search tree is node Based binary tree data structure. Each node has A key and Associated value parent left child right child
- 5. btrees - 5 Properties of Trees and Nodes » internal node has 1 or more children, root node leaf nodes internal nodes
- 6. btrees - 6 Properties of Trees and Nodes root node is the highest node in the tree structure, and it has no parent siblings: two nodes that have the same parent edge: the link from one node to another null is Empty root siblings edge
- 7. btrees - 7 TRAVERSAL Is systematic ways of vesting nodes in a three There are three different types of depth-first traversals i. Pre-order traversal ii. In-order traversal iii. Post-order traversal
- 8. btrees - 8 Pre-order traversal has 3 steps Visit Node traversal left sub-tree traversal Right sub-tree 23 18 12 20 44 35 52
- 9. btrees - 9 In-order traversal Traverse the left sub-tree Visit the root. traversal the Right sub-tree 12 18 20 23 35 44 52
- 10. btrees - 10 Post-order traversal Traverse the left sub-tree traversal the Right sub-tree Visit the root 12 20 18 35 52 44 23
- 11. btrees - 11 Thank You IEEEAsseged@gmail.com