Harsh-7300/dataset huggingface dataset:
Question: How quick sort works?
Reference answer: Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.

Student answer: quick sort divides the given array in two parts in which the point from where we divided , the left side is occupied by the elements which are smaller than the pivot and the right side is occupied by the elements greater than the pivot (pivot - middle element of the array). after all the sorting process we get an array which is in ascending order.
Score: 2.5

Student answer: In quick sort , we first select a pivot element. Then we use recursion to keep the elements lower than the pivot element to the left of the pivot and the element greater than the pivot element to the right of the element and do this until the array is sorted
Score: 2.5

Student answer: Quick sort algorithm works on the array by traversing array from both the ends start to end or end to start and arrange it in increasing or decreasing sequence
Score: 1.0

Student answer: in this an element is made pivot and then we compare pivot to all the elements in an array  and when pivot comes in middle we divide the array into two in which left side of pivot is smaller than pivoted element and right side is greater than pivot and again follows same process.
Score: 2.5

Student answer: in quick sort, first the a pivot is declared in the middle of the array then two pointers one at the beginning and one at the last respectively. The pointer at the start of the array moves forward and checks weather the value of pivot is greater or less than it. If the value is more, they digits are swapped, if it is less then the pointer moves forward. similarly The pointer at the last of array moves towards the left comparing the digits and then swapping the values of last and first pointer if the digit is less than it. Now the left side of pivot contains the digits smaller than it and right side greater. Now this function is again called for the left and right side of the array respectively, as a result the array is sorted.
Score: 2.5

Student answer: quick short short a date and bring  a desirable output to the audience 
Score: 0.0

Student answer: it takes a pivot point and breaks the left array into sub arrays taking centre as pivot, and it continues till we reach to individual items and the we rejoi the values by compaing them.
Score: 2.0

Student answer: in quick sort we having i and j i move to end of array and j move to starting of  array I is find bigger element and j finding smaller element swap them again doing same thing 
Score: 1.0

Student answer: pivot elements.
Score: 0.5

Student answer: in this sorting algorithim the partition is create in an unsorted array in which the first part is sorted and corresponding the second part is sorted 
Score: 0.0

Student answer: quick sort working is similar as selection sort,
Score: 0.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: The process of travelling/visiting every node of a tree is referred to as tree traversal.
Score: 1.0

Student answer: there are 3 tree traversals which are preorder, postorder, inorder . tree traversals are generally an idea to visit every node of a tree in division of three which are either root->left subtree->right subtree, left subtree->right subtree->root, left subtree->root->right subtree respectively
Score: 2.5

Student answer: In tree traversal all the elements which are present in the tree are exactly visited once tree traversal can be done in many different ways like BFS which is breadth first search and dfs which is depth first search  
Score: 2.0

Student answer: Tree traversal refers to traversing the tree data structure starting from root node than moving to every child of the tree
Score: 2.0

Student answer: Tree traversal refers to the accessing the elements inside the tree. It can be done in 3 ways, preorder traversal, inorder traversal, postorder traversal. \nPreorder traversal starts accepts the root node as input, traverses root first then the left child and at last the right child.\nInorder traversal traverses left child then root then right child.\nPostOrder traversal goes left child then right child then root.
Score: 2.5

Student answer: Tree traversal is used to traverse every node of tree data structure. \nTraversing every node from root to leaf 
Score: 2.0

Student answer: tree traversal is a method in which left sub tree is visited first then root is visited and at last the  left sub tree. 
Score: 1.0

Student answer: Tree traversal is of 3 types postorder, inorder and preorder. Through tree traversal we write all the elements of the tree . Like in postorder traversal first it takes the left node then it takes the right node then it takes the root node.
Score: 2.5

Student answer: Tree traversal is visiting each and every node in a tree\nthere are three types of tree traversal \npostorder (first left then right then node)\ninorder (first left then node  then right)\npreorder (node left then left then right)
Score: 2.5

Student answer: tree traversal is a process to visit all the nodes of a tree to carry out a particular function and may print their values too.
Score: 1.0

Student answer: Tree traversal is the traversing or visiting the each node of the tree .
Score: 1.0

Student answer: Checking or observing any node of a tree in order to obtain the solution of your search is called tree traversal.
Score: 1.0

Student answer: Tree traversal  means  traversing  tree  in DFS or BFS form and going through each node and storing it's data and then retrieving it.
Score: 1.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: There are three types of traversing/ looking through/ reading the values stored in a tree, which include inorder preorder and postorder treversal. \nInorder: left child-> root -> right child\nPreorder:  root ->  left child-> right child\nPostorder: right child-> left child -> root
Score: 2.5

Student answer: moving on each node of the tree is called tree traversal.\n 
Score: 1.0

Student answer: Exploring/visiting each and every node of the tree is know as tree traversal.
Score: 2.0

Student answer: Tree is a data structure and there are three tree traversal techniques that help us read data from all the nodes without leaving any node\n1. Breadth First Search : In this, start from root node and store all the children of root node in a queue and then take an element from queue, explore that node and keep repeating this till all nodes are found/read\n2. Depth First Search : in this  start from root node and store all the children of root node in a stack and then take an element from stack, explore that node and keep repeating this till all nodes are found/read\n3. Level order Traversal : start from the first level, explore all the nodes on that level and then go to the next level and keep on repeating till you hit the bottom level
Score: 2.0

Student answer: In quick sort, there exist a pivot which plays a major role in sorting the array quickly.\nIt sorts the array in such a way that the value before pivot are smaller than it and the values ahead of the pivot are greater than it.\nIt is hence to be checked again and again until pivot reaches to the last.
Score: 0.0

Student answer: tree traversal is the technique in which we traverse each node from root to leaf of the tree effectively ,it can be post, order ,pre order,  inorder  traversal
Score: 2.5

Student answer: Tree traversal is traversing a list of elements in a tree using different approaches.
Score: 1.5

Student answer: Tree traversal is a pattern for traversal in a tree which covers every node of a tree in a particular set pattern .\nExample- Preorder traversal => root->left->right (It utilizes this pattern to print all the nodes of a tree)\n                In order Traversal => left->root->right\n                Post order traversal => left->right->root
Score: 2.5

Student answer: Tree traversal is meant by visiting every node that comprises of a tree, and it could be in any order. \nexample:  preorder(root->left->right)\n  inorder (left->root->right)or\n postorder (left->right->root)
Score: 2.5

Student answer: Tree traversal is a method of exploring the every nodes of tree from its  root to its children node. The time taken to traverse the tree is O(logn)\nMethods of tree traversal are:\nlevel order traversal \npost order traversal \npre order traversal\ninorder traversal \n
Score: 2.5
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: Quicksort is one of the most efficient sorting algorithms. This is because it has time complexity of O( nlogn ). In quicksort, a partition element is choosen, which divides array into two subarrays and the array is sorted accordingly. For example, if A={7,3,9,5,8,12} is an array with partition element 5, all elements less than 5 will come to the left of 5 and all elements greater than 5 will be placed to the right of 5.  Since this array is still not sorted, we will apply same algorithm on the two subarrays which are present on the left and right of 5. Hence by divide and conquer approach, eventually entire array will be sorted. 
Score: 0.0

Student answer: tree traversal is where we go through each and every node and print there data  through our print function,\nexample :level order traversal ,preorder , Postorder , Inorder .
Score: 2.5

Student answer: When we are searching for an element in a tree and if the element is smaller than the root we go left side of the parent node otherwise when it's larger we go right side of the parent node and this process continues as we keep on moving left and right until we find the element in the tree.
Score: 2.0

Student answer: The traversal of a tree from its root note and visiting every single node until it reaches the root node is known as tree traversal.
Score: 2.0

Student answer: The traversal of a tree initiating from the root node and visiting its each child using preorder, in order and post order traversal basis.
Score: 2.5

Student answer: travelling from root to the each leaf node of the given tree is called tree traversal.
Score: 2.0

Student answer: Tress traversal means visiting all the nodes of a tree one by one from root to the last leaf node.
Score: 2.0

Student answer: travelling a tree is known as tree traversal. there are three types of tree traversal which are LNR, NLR, LRN                  left node right, node left right, left right node respectively\nin LNR first the left side of the tree is traversed then the node is printed then it goes to the right side. Similarly all the other traversals work.
Score: 2.0

Student answer: Tree traversal is of two types:\n1) we build a tree and travers the value by level order , level order means we traverse the each and every element at height =1 then we go to higher height\n2) we build a tree and traverse its value like going left side of tree or right side of tree, means we are going left until we find null value .  
Score: 1.0

Student answer: tree traversal is basically going to each node of the tree once .
Score: 1.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: Tree traversal is the process in which the top most node is the root node and all nodes are connected with 2 sub nodes(right and left ).right node (greater value than root) left node(lesser value than root) If u want to traverse to a particular node u start with root node and the on the basis of whether particular node is greater than root node or not u traverse to go to the right node or the left node. 
Score: 1.0

Student answer: there are Three methods for tree traversal. \n1. In-order- first we traverse left part of the root  node , then root node , and then right node. \n2. Pre-order - First we go to the  root  node , then traverse the left part and then the right part. \n3.Post-order - first we traverse the left part, then right part and then to the root node . 
Score: 2.5

Student answer: Tree traversal refers to the process of visiting nodes in a tree. Tree traversal can be divided into in-order, pre-order and post-order.
Score: 2.5

Student answer: tree traversal is visiting all the nodes of the tree including root node, parent node and child node.\ntypes of tree traversal are:\nin-order ,post-order and pre-order.
Score: 2.5

Student answer: The traversing of the the nodes and child nodes of the tree data structure by going top to bottom or bottom to top which the help of temporary pointer is called tree traversal.\nIt can be used in many ways like finding the element and inserting the element or deleting the element or comparing the 2 or more elements.
Score: 2.5

Student answer: In insertion sort, we divide the given array in two parts such that 1st array has 1 element which is the first element of array and 2nd array has all other elements in same order. Now, we traverse the 2nd array and find smallest element and add this element to 1st array in sorted order. We repeat this step till 2nd array becomes empty and first array has all the elements.\nIn selection sort, we take a pivot element and start comparing elements from start and end simultaneously and swap when any condition satisfies without dividing the array.
Score: 2.5

Student answer: tree traversal refers to accessing each element(node) of the tree one by one in some order.eg: inorder, preorder amnd postorder.
Score: 2.0

Student answer: Traversal in a tree, to find an element is present in it or not is known as tree traversal.\nIt can be done in three ways:\nInorder (left, root, right)\nPreorder (root, left, right)\nPostorder (left, right, root)\n
Score: 2.5

Student answer: Traversing the tree from its root node to its both child all along till the leaf nodes to access each nodes in the tree is called tree traversal . It can be done by traversing the nodes in three ways :-\ninorder (left, root ,right)\npreorder(root, Left, Right)\npostorder(Left, Right, root
Score: 2.5
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: in tree traversal what we do is that we perform traversal on the tree to look out for the desired solution. traversal is just like travelling from one of node of the tree to another just to find out the solution.\ninorder\npostorder\npreorder
Score: 2.5

Student answer: In Quick Sort, a random element from the array is chosen as the pivot element (ideally, the median) and then that pivot is compared to all the elements and the elements are sorted according to it. The elements smaller to pivot on its left and the elements larger than pivot on it's right. Just like that, the array is sorted.
Score: 2.5

Student answer: The traversal of elements of a tree array based on the root node, left node and right node.
Score: 2.5

Student answer: Tree is a data-structure and tree traversing means visiting each and every node of the tree to search for a particular element. We search for the elements starting from root node and going down to the child and leaf nodes of the tree.
Score: 2.5

Student answer: Accessing all the values stored in the node of tree starting from first node that is root node to all the leaf node until the pointer which is traversing gives a null is called Tree Traversals.
Score: 2.5

Student answer: Tree traversal is the process of exploring each and every node of the tree till all the leaf nodes are covered. 
Score: 2.5

Student answer: The process of accessing the different nodes of the tree is called tree traversal.
Score: 2.5

Student answer: The process of traversing(or visiting) each element of a tree is known as tree traversal.
Score: 1.5

Student answer: Tree Traversal is the moving of pointer at every node of tree from root to the leaf in order to print the stored data or search the element stored in a tree. Inorder,Preorder and Post order are few types of tree traversals.
Score: 2.5

Student answer: Tree traversal is a technique to traverse all elements of a tree node.  types of tree traversal :\n1. Preorder traversal\n2. Inorder traversal\n3. Postorder traversal\n\n
Score: 2.5

Student answer: To travel from source node/vertex to goal node in a tree 
Score: 2.5

Student answer: it is traversal of a tree and has 3 types, left data right (ldr), left right data (lrd), data left right (dlr), where each of this reperresents the child to be traversed with repsect to the parent node. It can be easily implemented by using recursion. 
Score: 2.5

Student answer: Tree traversal is visiting the nodes of tree until the required outcome is obtained.
Score: 2.5

Student answer: Tree traversal means in which manner we visit the nodes of the tree.
Score: 2.5

Student answer: the tree traversal is printing a tree in simple language via going through each and every node present in the tree
Score: 2.5
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: Tree traversal is traversing each node of the tree from root to the leaf nodes. 
Score: 2.5

Student answer: Tree traversal is the process of accessing all the elements of a tree\nThere are several tree traversal methods. Some include\n1) Pre order traversal \n2) In order traversal\n3) Post order traversal\n4) Level order traversal
Score: 2.5

Student answer: Traversing or traviling to each node of a tree is called tree traversal.
Score: 2.5

Student answer: traversing to all the branches of a tree 
Score: 2.0

Student answer: It means visiting each node at least once 
Score: 1.0

Student answer: traversing to all nodes by level- by level
Score: 1.0

Student answer: tree traversal meaning walking/traversing through a tree i.e. going through every node of the tree until a specific node is reached. There are three ways in which we can traverse a tree:\n1. pre-order traversal\n2. in-order traversal\n3. post-order traversal
Score: 2.5

Student answer: Tree traversal could be defined as the process of searching something inside the tree, as we start from root go to its leftmost child , then search in its child, come back(if not found ) then again search in the next child of root node and keep searching until the end of tree.
Score: 1.0

Student answer: traversing the given elements in a tree based on their sizes with the smaller element taking the left and bigger one sticking to right. Based on M or the number of elements that can be entered, the levels  gave m-1 values
Score: 1.0

Student answer: Tree traversal is a type of linear search where we can find the node or the string by traversing the tree .
Score: 1.5

Student answer: In the tree traversal  we traverse to root node to the leaf node.\nTheir are thre types of the tree taversal :-\nINORDER TRAVERSAL \nPREORDER TRAVERSAL\nPOSTORDER TRAVEWRSAL 
Score: 2.5

Student answer: it is traversing of a tree from its root node to it smallest leaf node .
Score: 1.0

Student answer: Tree traversal refers to visiting all the nodes of a tree at least once. For each node, we define if it is unvisited, visited or completely explored. Using various algorithms, we can then traverse the tree until every node has been completely explored. 
Score: 2.0

Student answer: Visiting each node of the tree is called tree traversal. Tree traversal can be used to search any element in the tree.
Score: 2.5

Student answer: it is terminology given to iterating a tree data structure.
Score: 2.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: Traversing each node of the tree is called tree traversal.\nFollowing are the the types: \n1. In-order traversal : Left child node->parent node->right child node\n2. Pre-order traversal :  parent node->Left child node->right child node\n3. Post-order traversal:  Left child node->right child node->parent node\n4. Breath first traversal /  level order traversal : each node is traversed level wise
Score: 2.5

Student answer: tree taversal is a technique in which the move through all the elements in the tree exactly once and print them in the desired techniques.\nthere are basically three traversal techniques, Preorder Traversal, Inorder traversal and Postorder traversal.
Score: 2.5

Student answer: Tree traversal means to print the value stored in every node of a tree.
Score: 1.0

Student answer: Tree traversal is traversing each and every node of a tree following are the possible traversals:\n->Pre Order\n->In Order\n->Pos tOrder
Score: 2.0

Student answer: When a data structure called tree's every node is visited in accordance to the traversal method then that is called tree traversal.
Score: 2.5

Student answer: Tree traversal is the process of traversing every node of the tree and exploring the child node of every till all the nodes of the are covered \ntraversal types are preorder,postorder,inorder
Score: 2.5

Student answer: Tree traversal is the process of visiting each node in tree exactly once. Traversing can be done by three ways inorder, preorder, postorder.
Score: 2.0

Student answer: visiting all the nodes of a tree is known as tree traversal 
Score: 1.0

Student answer: tree traversal is the traversal in tree on each node  once and then 
Score: 1.0

Student answer: Tree Traversal is a method to explore/visit different nodes in a tree
Score: 1.0

Student answer: visiting every node in the tree is known as tree traversal.We have different types of traversal like LDR,RDL,DLR
Score: 2.0

Student answer: Tree Traversal is a method of visiting each node a node in a systematic order.
Score: 1.0

Student answer: tree traversal is visiting each and every node of a tree
Score: 2.0

Student answer: Tree traversal is technique where traversing starts from root node to leaf node.Every node has a parent node.In BST THE RIGHT SIDE>PARENT AND LEFT SIDE<PARENT so we get min and max elements easily.
Score: 2.0

Student answer: it involves visiting each node of a tree once.
Score: 1.0

Student answer: Tree Traversal is the technique by which we can search through the nodes of the tree . \nThere are many ways by which we can traverse along a tree - Breath First  Search (BFS), Depth First Search (DFS)
Score: 2.0

Student answer: Tree traversal is the traversal of  a tree from start node to leaf node. 
Score: 1.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: Tree traversal is visiting of every node of a tree from start node to leaf node. 
Score: 1.0

Student answer: tree traversal is the traversal of node pointer starting from the root to every other node of tree.
Score: 1.0

Student answer: Traversing each element of the tree is known as tree traversal.\nIts is of 2 types - BFS, DFS.
Score: 2.0

Student answer: Tree traversal is a operation in which printout all the data present in tree , there are different type of tree traversal that can be performed. 
Score: 2.0

Student answer: its a method to travel from node to node in a tree data structure, there are condition like going to child or parent.
Score: 1.0

Student answer: it is basically visiting every node exactly once present in the tree
Score: 2.0

Student answer: Visiting of each and every element in a tree is called tree traversal. Following are some of the types of tree traversals:-\n1. In order (Left child, Parent, Right Child)\n2. Pre order (Parent, Left Child, Right Child)\n3. Post order (Left Child, Right Child, Parent)
Score: 2.5

Student answer: tree traversal means traversing and and visiting every node starting from the parent to the root node and then to the child node\n
Score: 2.0

Student answer:  element. \n1-The pivot can be chosen as the first element or the last element or the middle element.\n2-Next, we divide the array by putting the elements greater than pivot in the right and the elements less than the pivot in the left.\n3- Now this process is continued till we have single elements at last\n4- Now, we combine the elements to form the sorted array.
Score: 0.0

Student answer: Quick sort is divide and conquer algorithm in this first we choose the pivot element then we place the pivot element in its correct place and then again do the same with remaining elements
Score: 0.0

Student answer: Tree traversal are the different approaches in which we can iterate/travel through a tree (which can be represented in the form of an array).  The different forms f traversal are pre-order, in-order and post-order and the level-order tree traversal methods. For example in level order tree traversal we traverse the tree in the increasing number of it's levels from left to right.
Score: 2.5

Student answer: traversing a tree means visiting every node of a tree can be BFS traversal, DFS traversal,\nin BFS it refers to breadth first search while DFS refers to depth first search\nin DFS we make stacks and push elements and perform our process, \nin BFS traversal we make queue and push the root of the element and push its left and right child accordingly\nthis way we can access each node of that tree.\n
Score: 2.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: Tree is A non Linear Data Structure in which data are stored in nodes\nSo linear Searching Would not be possible to excess all nodes through branches\nSo mainly There are two Traversal \n->BFS(Breadth First Search):Tree is traverse level wise (Require stack to implemented)\n->DFS(Depth First Search):One Brach is traverse followed by next (recursively implemented)
Score: 2.0

Student answer: tree traversal means travelling through the branches to the leaf node or vise versa .
Score: 1.0

Student answer: Tree traversal is basically used to traverse the whole tree either first left subtree or right or root node. Three types are inorder , preorder and postorder.
Score: 1.0

Student answer: traversing to the tree from each of its nodes leaf node from top to bottom as per our need
Score: 2.0

Student answer: in this traversal method, the left subtree is visited first, then the root and later the right sub-tree.
Score: 1.0

Student answer: Travelling through nodes in a tree is known as tree traversal.
Score: 2.0

Student answer: Travelling all the nodes of a tree starting from the root node to all the leaf nodes is called tree traversal. There are basically three types of tree traversals\n1) Inorder traversal\n2) preorder traversal\n3)post order traversal
Score: 2.0

Student answer: tree traversal is traversing in the tree from one node to any other node of the tree.
Score: 1.0

Student answer: Tree traversal refers to iterating over all the elements from the root to leaves using BFS, DFS etc.
Score: 1.0

Student answer: Tree traversal refers to the way we travel a tree. The three types of traversals are In order, Pre Order and Post order. \nIn order:  left->root node->right\nPre Order:  root->left->right\nPost order:  left->right->root
Score: 2.0

Student answer: tree traversal is traversing the tree in 2 forms-\n1.dfs-depth first traversal-uses recursive algorithms\n2.breadth first traversal-uses queue data structure\n
Score: 1.0

Student answer: Tree traversal is the order in which the nodes are visited/printed for various purposes. Example: Postorder Traversal
Score: 2.0

Student answer: Quick sort partitions the array into two parts and sorts the both the partitioned parts hand by hand.
Score: 2.0

Student answer: We go through each and every node of the tree in order to inspect all the nodes of the tree.\n\ninorder - > left, root, right\npreorder - root, left ,right \npostorder - left, right, root
Score: 1.0

Student answer: It is the traversal where each node is traversed in bfs or dfs fashion.
Score: 1.0

Student answer: a form of graph traversal and refers to the process of visiting (like retrieving, updating, or deleting) each node in a tree data structure, exactly once.
Score: 2.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: In Quick sort a key element is taken randomly from the array and then it is placed on its true place and then the other elements are sorted accordingly using that element.
Score: 1.0

Student answer: Tree traversal is the procedures where all the nodes of the tree are visited (traversed).\n\nThere are many kinds of traversal such as:\n1. Pre order\n2. Post order\n3. In-Order
Score: 1.0

Student answer: Traversing a tree means visiting every node in the tree. You might, for instance, want to add all the values in the tree or find the largest one. For all these operations, you will need to visit each node of the tree.
Score: 1.0

Student answer: Traversing the whole tree from root node to the leaf node is tree traversal. We have three methods to traverse:\n\n1. Preorder Traversal - First we traverse root element, then left node and then right node\n2.  Inorder Traversal - First we traverse left node, then root and then right node\n3. Postorder Traversale - First we traverse left node, then right node and then root
Score: 2.0

Student answer: traversing elements in order of the tree. There are three types of tree traversals in-order traversal, pre-order traversal, post-order traversal.
Score: 2.0

Student answer: travelling through each node in a tree is called tree trasveral.
Score: 2.0

Student answer: The method of iterating through a tree to access its elements and perform different operations is called Tree Traversal. 
Score: 2.0

Student answer: linear searching is the an algorithm in which we transverse over the whole data set one by one and find if it a a matching data present in the data set.
Score: 1.0

Student answer: In any given tree, tree traversal is defined as the traversal of every element at all the levels or at every height of the tree.
Score: 1.0

Student answer: tree traversal is a procedure in which a root node of a tree is given as input and whole traversal or order of nodes in the tree is returned as output. there are many kinds of traversals like pre-order, post-order, in-order and in-depth traversal
Score: 2.0

Student answer: traversal of element present in trees data structures is called tree traversal . some tree traversal are inorder , preorder ,postorder.
Score: 1.0

Student answer: Tree traversal is the process of traversing nodes in a tree. Its usually done by traversing child nodes through the parent node.\nThere are three ways of traversal :-\n1)Preorder - Root -> Left -> Right\n2)Inorder - Left -> Root -> Right\n3)Postorder - Left -> Right -> Root
Score: 2.0

Student answer: Quick Sort works on the method of partition.\nIt makes partition on the array by selecting a random value and by making the problem smaller and smaller.\nFurthur it rejoins the array and the given array is sorted
Score: 1.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: Tree traversal refers to the binary tree or for finding the element in tree to arrange, basically by tree traversal we put number less than Node to the left side of Node and number greater than Node to right side of Node
Score: 1.0

Student answer: traversing through the tree nodes vertically downward by child to child left to left nodes and then right nodes which is called depth first search. \nor traversing all the siblings at the same level which is called breath first search.
Score: 2.0

Student answer: in order  traversal\npre order traversal\npost order traversal.
Score: 2.0

Student answer: tree traversal is a go through by an pointer through the whole tree to traverse
Score: 1.0

Student answer: Tree traversal is when we travel the tree covering each node and printing them or doing whatever is required. There are mainly 4 types of tree traversal: level order traversal, preorder traversal, inorder traversal, postorder traversal.
Score: 1.0

Student answer: Tree traversal means going to each and every node of the tree.
Score: 1.0

Student answer: Tree traversal is the technique to look each node of the tree by means of some methods \nPreorder Traversal\nPostorder Traversal\nInorder Traversal
Score: 1.0

Student answer: Tree traversal means going to each element of the tree and perform some action on it.
Score: 1.0

Student answer: tree traversal is traversing the tree in such a way that all elements of the tree get visited, it can take place by four ways that is preorder traversal, post order traversal, level order traversal and in order traversal
Score: 1.0

Student answer: in quick sort a element called pivot element is selected the that element is assigned its correct position, this divides the array into 2 parts then the element greater than pivot element are on side and element less than pivot element are on the other side. further again quick sort is applied on the two new array formed. 
Score: 1.0

Student answer: tree traversal is the process to visit all its nodes one by one.
Score: 1.0

Student answer: tree traversal is traversing the tree, Can be done in different ways first traversing the parent and then giving priority to their child nodes  or giving priority to the parent then their child nodes 
Score: 2.0

Student answer: Tree traversal is the process of travelling or accessing all the elements of a tree. There are several ways of traversing a tree like inorder, preorder or postorder.
Score: 2.0

Student answer: Tree traversal is a process in which left subtree is visited first ,then the root and then the right subtree.
Score: 2.0

Student answer: Tree traversal is simple exploring the branches of the tree one by one or we can say that the left and right child of the tree recursively from the parent node.
Score: 1.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: visiting every node in an tree data structure.
Score: 1.0

Student answer: quick sort work as if we have a arrow(cant recall the name), the fixed arrow which helps us to sort the array.
Score: 1.0

Student answer: tree traversal means moving from the root node towards the leaf nodes following the incoming child nodes.
Score: 2.0

Student answer: Tree traversal is traversing all the nodes of the tree from root node to leaf node using different traversals like preorder , postorder traversal, etc. 
Score: 2.0

Student answer: Tree traversal means visiting every node present in the tree till leaf node. 
Score: 2.0

Student answer: tree traversal is visiting each and every node the data structure tree. We can start with the root then the first level nodes, then the second level nodes and so on. We can also start with the leftmost one then its corresponding right node and so on.
Score: 2.0

Student answer: tree traversal is reading the elements of the tree in a certain order.\nIt can be done in preorder, inorder and postorder form.
Score: 2.0

Student answer: The tree traversal is the way of traversing the all nodes of a tree. There are mostly three types of tree traversal which are preorder, post order and inorder traversal.
Score: 2.0

Student answer: in tree traversal we move from parent element to its child element and vice versa\neg.  inorder traversal\npreorder traversal\npost order traversal\n\n
Score: 2.0

Student answer: Tree traversal is the traversing of every node of a tree from root to its children and so on . Its mainly done in three orders Postfix, Prefix, Infix.
Score: 2.0

Student answer: it is the process of traversing every node of the tree from root node to leaf.
Score: 2.0

Student answer: A tree traversal is the process of travelling to each and every node of the tree at least once.
Score: 2.0

Student answer: Quick sort partitions the array into two until every element is independent and then it returns the array sorting each element individually.\n
Score: 2.0

Student answer: Tree traversal is visiting all the nodes of a tree at least once, in any manner of traversal. 
Score: 2.0

Student answer: tree traversal is when the linked list is represented in a tree form so that the traversal is easy using BFS and  DFS
Score: 2.0

Student answer: Tree traversal is visiting each node of the tree once. Multiple techniques exist for the same. Example Inorder, Preorder, Postorder traversal. Also level order traversal. 
Score: 2.0

Student answer: Traversing a tree by visiting each vertex of the tree is called tree traversal.
Score: 2.0

Student answer: tree traversal is when we travel from one node of a tree to another node of the tree. 
Score: 2.0

Student answer: It is the technique use to traverse each node of a tree.
Score: 2.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: Tree Traversal is a process to visit all the nodes of a tree and may print their values too. Because, all nodes are connected via edges (links) we always start from the root (head) node. That is, we cannot randomly access a node in a tree.
Score: 2.0

Student answer: Tree traversal is traversing through the root node of the tree and moving to left node to get number less than the root node and traversing right to find the element greater than the root node and traversing till you find the root node of the tree to traverse the whole tree.
Score: 2.0

Student answer: tree traversal is the process of traversing through each and every node element of a tree type data structure , in order to look for a particular element or just to sort the tree as per our requirement in the problem statement.
Score: 2.0

Student answer: Traversal means to traverse or to check\\go through all the the nodes in an data structure. We traverse all the data structures to find what we need \nSimilarly we have tree traversal ,we traverse all the nodes of the tree using dfs or bfs to fin the information we need  
Score: 2.0

Student answer: Tree traversal means the analization of the tree, to travel the whole tree from the parent node to the child and cover each node of the tree.
Score: 2.0

Student answer: Tree traversal means to search and locate a given element or key from the tree.
Score: 2.0

Student answer: tree traversal is a process of traversing or visiting all the required nodes(including root and leafs) of a tree with the help of recursion or with the help of iteration.. Here we use the methods like DFS(depth first search using stack or recursion) and BFS(using queues).
Score: 2.0

Student answer: to traverse or visit every node of the tree starting from the root node by some type of algorithm is known as tree traversal
Score: 2.0

Student answer: In tree traversal we traverse all the required nodes in a tree using BFS or DFS.
Score: 2.0

Student answer: The process of reading every data in a tree is called tree traversal.
Score: 2.0

Student answer: Tree traversal is way to search the elements of tree data structure . There are different ways for tree traversal like preorder , inorder, postorder tree traversal.
Score: 2.0

Student answer: tree traversal is traverse the each and every node of the tree to search, insert of delete the data from nodes.
Score: 2.0

Student answer: tree traversal refers to traversing or visiting every node of the tree starting from root node to leaf node
Score: 2.0

Student answer: Traversing of all the nodes in a tree is known as tree traversal. There are various tree traversals such as:\n1. Preorder traversal\n2. Inorder Traversal\n3. Post order traversal\n4. Level order Traversal
Score: 2.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: It is the visiting of each node in the tree from root node to the leaf node. It explores all the parent to children node. There are various types of tree traversal such \nPre-order traversal , In-order traversal , Post-order traversal 
Score: 2.0

Student answer: tree traversal is a way to travelling the tree from one node to another mainly to find the element.
Score: 2.0

Student answer: Traversal is a process to visit all the nodes of a tree and may print their values too. Because, all nodes are connected via edges (links) we always start from the root (head) node. That is, we cannot randomly access a node in a tree. \n\n
Score: 2.0

Student answer: tree traversal is the process of traversing the elements of the tree in specific fashion \nsuch as inorder (root,left,right),preorder,post orderd
Score: 2.0

Student answer: tree traversal is to visit every node of an tree mainly of 4 types\npre order\npost order\n in order\nLevel order \n
Score: 2.0

Student answer: tree traversal is to traverse the tree by first taking the root node and then by taking the left node and then by taking the right node and applying recursion for the left and right node to fully traverse the tree
Score: 2.0

Student answer: Insertion sort performs sorting in a different way as compared to selection sort. It uses more time and is in general less efficient to sort as compared to selection sort. Insertion sort usually does it in O(n^2) time while selection sort in some cases can perform the same in O(nlogn). 
Score: 2.0

Student answer: It is a method in which the left subtree is visited first, then the root and later the right sub-tree and  every node may represent a subtree itself. If a binary tree is traversed in-order, the output will produce sorted key values in an ascending order.
Score: 2.0

Student answer: Tree Traversal -  when we have the Tree Data Structure(might be Binary - Full, Complete, etc.). Each node has children which further serve as nodes until we get the leaves - nodes with no children. So now we have a data structure with edges that is connecting two data values in the form of nodes. So when we want to perform any simple operation on the data structure like searching, etc. We go through all the nodes while traversing through the edges ( connections). This is known as tree traversals.
Score: 2.0

Student answer: Tree traversal is technique to traverse/cover each element of a tree.\nThere are various methods to traverse a tree:\n1) Postorder\n2) Preorder\n3) Inorder\n4) BFS\n5) DFS
Score: 2.0

Student answer: Tree traversal is the technique to retrieve information from a tree, This can of different types like:\nIn-order, pre-order, level-order, post-order etc.  
Score: 2.0
Question: What is tree traversal?
Reference answer: Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal

Student answer: Tree traversal is a way to traverse a tree and visit the elements present in the tree.\nIt is of three types:\nPreorder tree traversal:In this kind of traversal,the root node is visited first and then the left and then the right node.\nPostorder tree traversal :In this kind,the left node is visited first,then the right and then at the end the root node is visited.\nInorder tree traversal:In this kind,the left node is visited first,then the root node and then the right node.
Score: 2.0

Student answer: It is the process of gathering information from a tree by traversing a tree to perform certain operation.\neg: In order traversal ,pre order traversal and post order traversal.
Score: 2.0

Student answer: Traversing a tree means moving from the root node to the leaf nodes without missing a single node.\nIt needs to look through all the nodes. Used in searching a tree, inserting a new element, 
Score: 2.0

Student answer: tree traversal is a way to traverse every node of the tree from root node to the leaf node
Score: 2.0

Student answer: traversing a tree and collecting information to do certain operations
Score: 2.0

Student answer: in tree traversal we traverse the node of the tree from the root node to the element we want to search or to the leaf node. mostly we use recursion to traverse the tree.
Score: 1.0

Student answer: Tree traversal is a technique through which we traverse the tree formed using arrays i.e. we visit the nodes of the tree and perform the desired operation.
Score: 1.0

Student answer: it is a way of exploring different branches/nodes/elements of the tree .we have different types of tree traversal,like  level order traversal,pre order traversal,post order traversal,in order traversal,etc..which can be used according to the problem .
Score: 2.5

Student answer: Tress traversal refers to a way in which we go through the elements of a tree one by one, it can be dfs(depth first search) and bfs(breadth first search). In dfs, we traverse the tree by going down or up (depth) whereas in bfs we go left or right (breadth)
Score: 2.5

Student answer: In tree traversal we go element to element in tree by many methods like - bfs, dfs, inorder. 
Score: 2.5

Student answer: in the tree traversal we reach the every node of the tree and if want to print by the print function also.
Score: 2.5

Student answer: the manner in which a tree is traversed is called tree traversal. it is of three types, in-order, pre-order, post-order
Score: 2.0

Student answer: Tree traversal is the process of travelling nodes of tree, that is starting from the root node to the leaf node. The direction of tree traversal can depend upon the use cases. 
Score: 2.5