Skip to content

Update root-to-leaf_path(binary_tree).cpp #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
mohitarora3 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update root-to-leaf_path(binary_tree).cpp #1

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions root-to-leaf_path(binary_tree).cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

Question 6:

(BINARYTREE): Given a binary tree, print out all its root �to �leaf paths.
(BINARYTREE): Given a binary tree, print out all its root –to –leaf paths.

*/
#include<iostream>
Expand Down Expand Up @@ -51,7 +51,7 @@ void all_paths(struct node *root,queue<int> q,queue<int> q_temp)
else
{
/* if the node has both the left and right node then the root is pushed into the queue and
then the function is recalled with the subnodes as the root nodes */
then the function is recalled with the subnodes as the root nodes */
if(root->left!=NULL&&root->right!=NULL)
{
q.push(root->data);
Expand Down Expand Up @@ -94,7 +94,7 @@ struct node* newnode(int data)

int main()
/*
objective: to print out all its root �to �leaf paths of given binary tree
objective: to print out all its root –to –leaf paths of given binary tree
input parameters: none
output value: none
approach: a recursive function is called
Expand Down