This document describes a binary search tree structure with nodes containing keys that are either less than or greater than the root node key. It shows an example of inserting new nodes into the tree, with the new nodes being placed in the left or right subtree depending on whether their key is smaller or larger than the root node key. It also demonstrates searching the tree by traversing the nodes to find a matching keyword.

2. Root
Left key
(smaller than
root)
Right key
(greater than
root)
L
C
R
C

3. Drea
m
Slee
p
Drea
m
Slee
p
Let b=“DREAM” and a=“SLEEP” ,
Make c=-1

4. Apple
null null
-root
Temp
• When root element is already
present
Apple
Root
n Ant Bat
Titanic
new1 
Temp
Apple
Ant Bat
Titanic
Root
new1 
temp

5. Apple
Ant Bat
Titanic
Ball
Root
Bat
KEYWORD TO SEARCH
W
Ptr
Bat
B A T
Bat Keyword found

6. Apple
Ant
Ball Titanic
Bat
Ant Apple Ball Bat
Titani
c
2
3
1
LDR