-- if we have hierarchical data then we use tree data structure. --when a node that do not have parent node is called as "root node" . # The root node is the topmost node in a tree data structure. # ...
//int index=find_index(inorder,in_start,in_end,preorder[pre_start]); int index=index_inorder.get(preorder[pre_start]); root.left=buildTree(preorder,inorder,pre_start ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback