DSA Level 1 Basic Data Structures Binary Tree Find And Nodetorootpath In Binary Tree

Find And Nodetorootpath In Binary Tree

easy

1. You are given a partially written BinaryTree class.
2. You are given an element.
3. You are required to complete the body of find and nodeToRoot function. The functions are expected to 
    3.1. find -&gt; return true or false depending on if the data is found in binary tree.
    3.2. nodeToRoot -&gt; returns the path from node (correspoding to data) to root in 
    form of an arraylist (root being the last element)
4. Input iand Output is managed for you.

Input Format

Input is managed for you

Output Format

Output is managed for you

Constraints

None

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

19
50 25 12 n n 37 30 n n n 75 62 n 70 n n 87 n n
30

Output

true
[30, 37, 25, 50]

Iterative Pre, Post And Inorder Traversals Of Binary Tree

Print K Levels Down

Related Questions

easy Size, Sum, Maximum And Height Of A Binary Tree easy Levelorder Traversal Of Binary Tree easy Iterative Pre, Post And Inorder Traversals Of Binary Tree easy Print K Levels Down easy Path To Leaf From Root In Range easy Transform To Left-cloned Tree easy Transform To Normal From Left-cloned Tree easy Print Single Child Nodes easy Remove Leaves In Binary Tree easy Print Nodes K Distance Away easy Diameter Of A Binary Tree easy Tilt Of Binary Tree easy Is A Binary Search Tree easy Is Balanced Tree medium Largest Bst Subtree