Problem 2 Implement Searching for Binary Tree Description: Implement Searching function for Binary Tree Data Structure.

[answerhappygod]

Problem 2 Implement Searching For Binary Tree Description Implement Searching Function For Binary Tree Data Structure 1 (44.92 KiB) Viewed 29 times

Data structure and C++, can you please use above picture input
and output? I need the same result of above picture... Thanks in
Advance!
Problem 2 Implement Searching for Binary Tree Description: Implement Searching function for Binary Tree Data Structure. Your function should output string of directions to get to value (R(right) or L(left)). If value does not exists in Binary Tree output -1. Since first node is (R)oot, replace R for root with H(head). Your code should implement functions for: • Insert - i value • Search - s value Example Output Input i 50 i 100 i 30 i 40 i 10 il i 25 s 25 s1 s 100 s 50 s 1212 s 30 S 40 s 10 HLLR HLLL HR H -1 HL HLR HLL х