Binary search tree Each node x has keyI] Pointers 12 left 6 right plx] 7 8Binary S hT earc ree y Each node x has: 9 5 12 – key[x] – Pointers: 1 6 y left[x] y right[x] 7 y right[x] y p[x] 8