Search code examples
data-structuresbinary-search-tree

How do I draw this BST tree?


Confused about the BST tree drawing, say you want to insert the values 12, 9, 4, 6, 5, 15, 14, 16, 17, 18 into an empty binary search tree in the given order without balancing. What will the tree be like after each insertion? And what will happen to the tree if the value 12 is deleted?


Solution

  • BST Tree Drawing


    Tree: Value 12 is deleted